RCRA 2018

25th RCRA International Workshop on

"Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion"

Workshop of the Federated Logic Conference 2018 (FLoC 2018)



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.

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: April 26th, 2018
  • Notification of acceptance: May 15th, 2018
  • Final version of accepted original papers: TBC
  • RCRA workshop:  July 13th, 2018


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 2018 uses EasyChair for the submission of contributions. 

  
Papers can be submitted through this pagehttps://easychair.org/conferences/?conf=rcra18


Submissions will be reviewed by at least three members of the program committee.
 
  
Workshop co-chairs
  • Marco Maratea – Università di Genova (Italy)
  • Mauro Vallati  University of Huddersfield (UK)

Workshop program committee
 
  • Mario Alviano, Department of Mathematics and Computer Science, University of Calabria
  • Marcello Balduccini, Saint Joseph's University
  • Laura Barbulescu, Carnegie Mellon University
  • Roman Barták, Charles University
  • Stefano Bistarelli, Università di Perugia
  • Pedro Cabalar, University of Corunna
  • Francesco Calimeri, Department of Mathematics and Computer Science - University of Calabria
  • Stefania Costantini, Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica, Univ. dell'Aquila
  • Alessandro Dal Palù, Università degli Studi di Parma
  • Luca Di Gaspero, DPIA - University of Udine
  • Carmine Dodaro, University of Genova
  • Esra Erdem Sabanci, University
  • Wolfgang Faber, Alpen-Adria-Universität Klagenfurt
  • Jorge Fandinno, Coruña University
  • Andrea Formisano, Dip. di Matematica e Informatica, Università di Perugia
  • Fabio Gadducci, Dipartimento di Informatica, Università di Pisa
  • Marco Gavanelli, University of Ferrara
  • Matti Järvisalo, University of Helsinki
  • Zeynep Kiziltan, University of Bologna
  • Toni Mancini, Sapienza University of Rome 
  • Joao Marques-Silva, Universidade de Lisboa
  • Angelo Oddi, ISTC-CNR, Italian National Research Council
  • Gian Luca Pozzato, Dipartimento di Informatica - Università di Torino
  • Luca Pulina, University of Sassari
  • Francesco Ricca, Department of Mathematics and Computer Science University of Calabria
  • Francesco Santini, University of Perugia
  • Valentino Santucci, University of Perugia
  • Torsten Schaub, University of Potsdam
  • Peter Schüller, Vienna University of Technology
  • Ivan Serina, University of Brescia
  • Thomas Stützle, Université Libre de Bruxelles (ULB)
  • Paolo Torroni, University of Bologna
  • Mirek Truszczynski, Computer Science Department, University of Kentucky
  • Richard Wallace, University College Cork
  • Johannes P. Wallner, Vienna University of Technology
  • Stefan Woltran, Vienna University of Technology
  • Neng-Fa Zhou, CUNY Brooklyn College and Graduate Center


Proceedings

TBC

As in previous editions (http://rcra.aixia.it/publications), 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.


Contact

In case of need, the workshop co-chairs can be contacted by sending an email to:  rcra18[AT]easychair[DOT]org
Comments