[Elsnet-list] RCRA 2013: Abstract Submission Deadline Approaching

Francesco Ricca ricca at mat.unical.it
Sat Mar 9 10:17:15 CET 2013


* ______________________________________________________________________   *

  The RCRA group (Knowledge Representation & Automated Reasoning) of the
         AI*IA (Italian Association for Artificial Intelligence)

                              organizes the

                           20th RCRA workshop:
             Experimental evaluation of algorithms for solving
             problems with combinatorial explosion  (RCRA 2013)

                      Rome, Italy, 14-15 June 2013

  RCRA group web site: http://rcra.aixia.it/
  Workshop web site:   http://rcra.aixia.it/rcra2013
  e-mail:              rcra2013 at gmail.com

* Abstract submission:                       >>>>10 March 2013 <<<<
* Submissions to the RCRA workshop:          15 March 2013
* Notification of acceptance/reject:         19 April 2013
* Final version due:                         15 May 2013
* RCRA workshop:                             14-15 June 2013

* ______________________________________________________________________   *

  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.

* ______________________________________________________________________   *

The workshop will take place in Rome, Italy from 14 to 15 June 2013.
RCRA 2013 will be held immediately after ICAPS 2013.

As in previous editions (http://rcra.aixia.it/publications), authors of
papers orally presented at the workshop will have the opportunity to participate
to the selection of a special issue that will appear on an international journal.

* RCRA 2012 as a workshop of AI*IA 2012, Rome, Italy - http://rcra.aixia.it/rcra2012
  Extended versions of the best papers will appear in a special issue of AI Communications
* RCRA 2011 as a workshop of IJCAI 2011, Barcelona, Spain - http://rcra.aixia.it/rcra2011
  Extended versions of the best papers appear in a special issue of AI Communications
* RCRA 2010 in association with CPAIOR 2010, Bologna, Italy - http://rcra.aixia.it/rcra2010
  Extended versions of the best papers appear in a special issue of Annals of Math. and AI
* Previous editions: http://rcra.aixia.it/workshops

* Abstract submission:                       10 March 2013
* Submissions to the RCRA workshop:          15 March 2013
* Notification of acceptance/reject:         19 April 2013
* Final version due:                         15 May 2013
* RCRA workshop:                             14-15 June 2013

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 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

* Toni Mancini               Sapienza University, Rome, Italy
* Marco Maratea              University of Genova, Genova, Italy
* Francesco Ricca            University of Calabria, Rende, Italy

* Roman Bartak               Charles University, Prague (Czech Republic)
* Stefania Costantini        Università dell'Aquila (Italy)
* Alessandro Dal Palù        Università di Parma (ItalY)
* Agostino Dovier            Università di Udine (Italy)
* Esra Erdem                 Sabanci University, Istanbul (Turkey)
* Wolfgang Faber             Università della Calabria, Rende (Italy)
* Ines Gonzalez Rodriguez    University of Cantabria, Santander (Spain)
* Joerg Hoffmann             Saarland University, Saarbruecken (Germany)
* Matti Jarvisalo            University of Helsinki (Finland)
* Zeynep Kiziltan            Università di Bologna (Italy)
* Philippe Laborie           ILOG, IBM Gentilly (France)
* Michele Lombardi           Università di Bologna (Italy)
* Ines Lynce                 Universidade Técnica de Lisboa (Portugal)
* Paolo Marin                Albert-Ludwigs-Universität Freiburg (Germany)
* Joao Marquez-Silva         University College Dublin (Ireland)
* Luigi Palopoli             Università della Calabria, Rende (Italy)
* Steve Prestwich            University College Cork (Ireland)
* Luca Pulina                Università di Sassari (Italy)
* Riccardo Rasconi           ISTC-CNR, Rome (Italy)
* Fabrizio Riguzzi           Università di Ferrara (Italy)
* Rubén Ruiz García          Universidad Politécnica de Valencia (Spain)
* Alessandro Saetti          Università di Brescia (Italy)
* Torsten Schaub             University of Potsdam, Berlin (Germany)
* Thomas Stützle             Université Libre de Bruxelles (Belgium)
* Mirek Truszczynski         University of Kentucky, Lexington (USA)


     Sapienza University, Rome, Italy

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.

At the time of submission, authors are requested to clearly specify whether their
submission is original or already published.

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-based 
RCRA 2013 style available at the workshop web site.

RCRA 2013 uses EasyChair for the submission of contributions. Details are available 
on the web-site.

Submissions will be reviewed by at least three members of the program committee.


Authors of papers orally presented at the workshop will have the
opportunity to participate to the selection for the post-proceedings
by submitting an extended version of their work.

As in previous editions (http://rcra.aixia.it/publications), workshop
post-proceedings will appear in a special issue of an international
journal, provided that a sufficient amount of high quality papers is collected.

All candidate articles must be original: they cannot have already been published
in journals, and must contain significant additional material with respect to any
formal publication.

Such papers will go through a second formal selection process, and will be 
reviewed by at least three reviewers. We aim at a short submission process, and 
at most one re-submission stage will be allowed.

More information about the Elsnet-list mailing list