23rd RCRA International Workshop on
"Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion"
Genova, Italy, 28 November 2016
NEW: Proceedings are available here
NEW: Preliminary program is available here
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 e xperimentation methodologies for algorithms in artificial intelligence.
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 hybridised with techniques in other areas. Artificial Intelligence
tools often exploit or hybridise techniques developed by other research
communities, such as Operations Research.
In recent years, research in AI 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-fertilisation 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 modelling, and ease of development.
Topics of interest include, but are not limited to:
- Experimental evaluation of algorithms for
- knowledge representation
- automated reasoning
- planning
- scheduling
- machine learning
- model checking
- Boolean satisfiability (SAT)
- constraint programming
- temporal reasoning
- combinatorial optimization
- argumentation
- quantified Boolean formulae and quantified constraints
- modal logics
- logic programming
- answer set programming
- 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, etc.)
Important dates
- Paper submission deadline: September 22nd, 2016
- Notification of acceptance: October 22nd, 2016
- Early registration: October 31st, 2016
- Final version of accepted original papers: November 15th, 2016
- RCRA workshop: November 28th, 2016
Submission guidelines
Authors
are invited to submit either original (full or short) papers.
Submission of papers already accepted/appeared on other conference
proceedings is permitted.
The authors are requested to clearly specify whether their submission is original or already published. A footnote in the first page would suffice.
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.
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.
Papers can be submitted through this page: https://easychair.org/conferences/?conf=rcra2016
Submissions will be reviewed by at least three members of the program committee.
- Stefano Bistarelli – Università di Perugia (Italy)
- Andrea Formisano – Università di Perugia (Italy)
- Marco Maratea – Università di Genova (Italy)
Workshop program committee
- Mario Alviano (University of Calabria)
- Roman Bartak (Charles University in Prague)
- Stefano Bistarelli (University of Perugia)
- Pedro Cabalar (University of Corunna)
- Federico Chesani (University of Bologna)
- Stefania Costantini (University of L'Aquila)
- Alessandro Dal Palù (University of Parma)
- Luca Di Gaspero (University of Udine)
- Carmine Dodaro (University of Calabria)
- Esra Erdem (Sabanci University)
- Wolfgang Faber (University of Huddersfield)
- Andrea Formisano (University of Perugia)
- Jorge Fandiño (University of Corunna)
- Martin Gebser (University of Potsdam)
- Yuliya Lierler (University of Nebraska at Omaha)
- Toni Mancini (Sapienza University Rome)
- Marco Maratea (University of Genova)
- Joao Marques-Silva (University of Lisbon)
- Angelo Oddi (ISTC-CNR)
- Gian Luca Pozzato (University of Torino)
- Luca Pulina (University of Sassari)
- Francesco Scarcello (University of Calabria)
- Claudia Schulz (Imperial College London)
- Peter Schueller (Marmara University)
- Ivan Serina (University of Brescia)
- Tran Cao Son (New Mexico State University)
- Mirek Truszczynski (University of Kentucky)
- Mauro Vallati (University of Huddersfield)
- Richard Wallace (University College Cork)
- Johannes P. Wallner (University of Helsinki)
- Neng-Fa Zhou (CUNY Brooklyn College and Graduate Center)
Accepted original papers will be published online, as an issue of the CEUR-WS workshop proceeding series, AI*IA sub-series.
As
in previous editions, the organizers 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
original papers is collected. In such case, authors of accepted papers (not already published on any journal) will be invited to submit extended
and revised versions of their papers. A second review formal process
will be run in order to meet the
expected quality of a journal.
In case of need, the workshop co-chairs can be contacted by sending an email to: rcra2016[AT]easychair[DOT]org
More information:
|
 Updating...
Marco Maratea, Sep 8, 2016, 9:09 AM
|