RCRA 2019

26th RCRA International Workshop on

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

Workshop of the 18th International Conference of the Italian Association for Artificial Intelligence (AIIA 2019)



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
  • Abstract submission deadline: September 5th, 2019
  • Paper submission deadline: September 8th, 2019
  • Notification of acceptance: September 29th, 2019
  • Final version of accepted original papers: October 30th
  • RCRA workshop:  TBD


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

  
Papers can be submitted through this page: https://easychair.org/conferences/?conf=rcra19


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


Wednesday 20th November. Approx 15+2    mins per talk


15.00-15.45: Session 1: SAT & Planning

15.00-15.10: Welcome 

15.10-15.45:

  • Minipref: A Tool for Preferences in SAT 

Carmine Dodaro and Alessandro Previti   

  • Compiling Planning Problems with Non-deterministic Events into FOND Planning

Lukas Chrpa, Martin Pilat and Jakub Gemrot   


15.45-16.15: Coffee break


16.15-18.00: Session 2: Applications

  • MOEA/DEP: An Algebraic Decomposition-Based Evolutionary Algorithm for the Multiobjective Permutation Flowshop Scheduling Problem

Marco Baioletti, Alfredo Milani and Valentino Santucci

  • Improving autonomous transportation through 5G and Machine Learning

Lorenzo De Lauretis and Tiziano Lombardi   

  • A strategy to decompose a service into microservices

Lorenzo De Lauretis, Angelo Aloisio and Francesca Pancella   

  • Decremental Consistency Checking of Temporal Constraints: Algorithms for the Point Algebra and the ORD-Horn Class

Massimo Bono and Alfonso Emilio Gerevini

  • Generation of a Complete Virtual Patients Population for T1DM Treatments

Agostina Calabrese, Toni Mancini, Annalisa Massini, Stefano Sinisi and Enrico Tronci

  • Machine Learning of Strategies in QBF Solving

Ricardo Silva and Mikolas Janota   

17.50-18.00: Closing Remarks

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
  • Lukas Chrpa, Czech Technical University and Charles University in Prague
  • Stefania Costantini, Dipartimento di Ingegneria e Scienze dell'Informazione e Matematica, Univ. dell'Aquila
  • Carmine Dodaro, University of Genova
  • Agostino Dovier, University of Udine
  • 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
  • Toni Mancini, Sapienza University of Rome 
  • Joao Marques-Silva, Universidade de Lisboa
  • Simon Parkinson, University of Huddersfield
  • Chiara Piacentini, Autodesk Research
  • 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
  • Ivan Serina, University of Brescia
  • Mirek Truszczynski, Computer Science Department, University of Kentucky
  • 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.
Comments