[DL] RCRA-AI*IA 2016 Preliminary Call for Papers
Andrea Formisano
formis at dmi.unipg.it
Wed Jun 15 17:29:40 CEST 2016
Dear all,
on behalf of the program chairs of RCRa 2016, I'm sending
you this CFP.
Please re-distribute. Thanks.
Cheers
Andrea
[APOLOGIES FOR MULTIPLE POSTINGS]
* ______________________________________________________________________ *
The RCRA group (Knowledge Representation & Automated Reasoning) of the
AI*IA (Italian Association for Artificial Intelligence)
organizes the
23rd RCRA workshop:
Experimental evaluation of algorithms for solving
problems with combinatorial explosion (RCRA 2016)
workshop of the 15th International Conference of the
Italian Association for Artificial Intelligence
http://www.aixia2016.unige.it/
Genova, November 28 - December 1, 2016
RCRA group web site: http://rcra.aixia.it/
Workshop web site: http://rcra.aixia.it/rcra2016
e-mail: rcra2016[AT]easychair[DOT]org
* ______________________________________________________________________ *
This event follows the series of the RCRA (Knowledge Representation
and Automated Reasoning) annual meetings, held since 1994.
The success of the previous events shows that RCRA is becoming a major
forum for exchanging ideas and proposing experimentation methodologies
for algorithms in Artificial Intelligence.
* ______________________________________________________________________ *
IMPORTANT DATES
Paper submission deadline: September 8th, 2016
Notification of acceptance: October 10th, 2016
Final version of accepted original papers: October 31st, 2016
Early registration: TBA (early-registration for AI*IA 2016)
Workshop day: November 28th, 2016
AIMS AND SCOPE
Many problems in Artificial Intelligence show an exponential explosion of
the search space. Although stemming from different research areas in AI,
such problems are often addressed with algorithms that have a common goal:
the effective exploration of huge state spaces. Many algorithms developed
in one research area are applicable to other problems, or can be hybridized
with techniques in other areas. Artificial Intelligence tools often exploit
or hybridize techniques developed by other research communities, such as
Operations Research.
In recent years, research in Artificial Intelligence has more and
more focused on experimental evaluation of algorithms, the
development of suitable methodologies for experimentation and
analysis, the study of languages and the implementation of systems
for the definition and solution of problems.
Scope of the workshop is fostering the cross-fertilization of ideas stemming
from different areas, proposing benchmarks for new challenging problems,
comparing models and algorithms from an experimental viewpoint, and, in
general, comparing different approaches with respect to efficiency, problem
modeling, and ease of development.
Topics of interest include, but are not limited to:
* Experimental evaluation of algorithms for
o knowledge representation
o automated reasoning
o planning
o scheduling
o machine learning
o model checking
o boolean satisfiability (SAT)
o constraint programming
o argumentation
o temporal reasoning
o combinatorial optimization
o quantified boolean formulae and quantified constraints
o modal logics
o logic programming
o answer set programming
o ontological reasoning
* Definition and construction of benchmarks
* Experimentation methodologies
* Metaheuristics
* Algorithm hybridization
* Static analysis of combinatorial problems
* Languages and systems for definition and solution of problems
* Comparisons between systems and algorithms
* Application experiences (visualization, graphics, security, transports,...)
WORKSHOP CHAIRS
* Stefano Bistarelli University of Perugia, Italy
* Andrea Formisano University of Perugia, Italy
* Marco Maratea University of Genova, Italy
WORKSHOP PROGRAM COMMITTEE
TBA
HOST ORGANIZATION
University of Genova, Italy
SUBMISSIONS
Authors are invited to submit either original (full or short) papers, or
papers that appear on conference proceedings.
Publications showing negative results are welcome, provided that the
approach was original and very promising in principle, the experimentation
was well-conducted, the results obtained were unforeseeable and gave
important hints in the comprehension of the target problem, helping other
researchers to avoid unsuccessful paths.
The authors are requested to clearly specify whether their submission is
original or already published. A footnote in the first page would suffice.
Workshop submissions must be in PDF format, do not exceed 15 (for full
papers) or 8 (for short papers) pages, and should be written in LaTeX,
using the LNCS style.
RCRA 2016 uses EasyChair for the submission of contributions.
Contributions must be submitted through this page:
https://easychair.org/conferences/?conf=rcra2016
All submissions will be reviewed by at least three members of the
program committee.
CONTACT
In case of need, the workshop co-chairs can be contacted by sending
an email to:
rcra2016[AT]easychair[DOT]org
PROCEEDINGS
Accepted papers will be published online, as an issue of the CEUR-WS
workshop proceeding series, AI*IA sub-series.
Moreover, as in previous editions (http://rcra.aixia.it/publications),
we are considering the possibility of having workshop post-proceedings
appearing in a special issue of an international journal, provided that
a sufficient amount of high quality papers is collected.
HISTORY OF THE RECENT WORKSHOP SERIES
* RCRA 2015 as a workshop of AI*IA 2015, Ferrara, Italy
http://rcra.aixia.it/rcra2015
Extended versions of the best papers will appear in a special
issue of Fundamenta Informaticae
* RCRA 2014 as a workshop of SAT 2014, IJCAR 2014 and ICLP 2014,
Vienna, Austria - http://rcra.aixia.it/rcra2014
Extended versions of the best papers will appear in a special
issue of AI Communications
* RCRA 2013, Rome, Italy - http://rcra.aixia.it/rcra2013
Extended versions of the best papers will appear in a special
issue of JETAI
* Previous editions: http://rcra.aixia.it/workshops
* ______________________________________________________________________ *
More information about the dl
mailing list