[CEUR Workshop Proceedings] Vol-589
urn:nbn:de:0074-589-9

Copyright © 2009 for the individual papers by the papers' authors. Copying permitted only for private and academic purposes. This volume is published and copyrighted by its editors.





RCRA-2009
Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion


Proceedings of the 16th RCRA workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion

Reggio Emilia, Italy, December 11-12, 2009.


Edited by

Marco Gavanelli *
Toni Mancini **

* Università di Ferrara, Dipartimento di Ingegneria, Via Saragat 1, 44100 Ferrara, Italy
** Sapienza Università di Roma, Dipartimento di Informatica, Via Salaria 113, 00198 Roma, Italy

Organized by

the RCRA working group (Rappresentazione della conoscenza e Ragionamento Automatico, Knowledge representation and automated reasoning) of the Italian Association for Artificial Intelligence





Table of Contents

  1. Comparing ASP and CP on Four Grid Puzzles
    Mehmet Çelik, Halit Erdoğan, Firat Tahaoğlu, Tansel Uras, Esra Erdem
  2. Applying Simulation and Reliability to Vehicle Routing Problems with Stochastic Demands
    Angel A. Juan, Scott E. Grasman, Javier Faulin, Daniel Riera, Carlos A. Méndez, Bernardo Ruiz
  3. Flexible Plan Verification: Feasibility Results
    Amedeo Cesta, Alberto Finzi, Simone Fratini, Andrea Orlandini, Enrico Tronci
  4. Improving the Automatic Test Generation process for Coverage Analysis using CBMC
    Damiano Angeletti, Enrico Giunchiglia, Massimo Narizzano, Gabriele Palma, Alessandra Puddu, Salvatore Sabina
  5. Advanced Heuristics for Parallel ASP Instantiation
    Simona Perri, Francesco Ricca, Marco Sirianni
  6. Evaluation of Knowledge Sharing Strategies in a Parallel QBF Solver
    Paolo Marin, Matthew Lewis, Tobias Schubert, Massimo Narizzano, Bernd Becker, Enrico Giunchiglia
  7. An Empirical Analysis of Some Heuristic Features for Planning with Local Search in LPG
    Alfonso Gerevini, Alessandro Saetti, Ivan Serina
  8. Efficient Kernels for Sentence Pair Classification
    Fabio Massimo Zanzotto, Lorenzo Dell'Arciprete
  9. An Automaton Constraint for Local Search
    Jun He, Pierre Flener, Justin Pearson
    Also appearing in Proceedings of the 6th International Workshop on Local Search Techniques in Constraint Satisfaction (LSCS 2009), volume 5 of Electronic Proceedings in Theoretical Computer Science, pages 13-25, 2009. DOI: 10.4204/EPTCS.5.2
  10. Constrained Optimization Over Massive Databases
    Toni Mancini, Pierre Flener, Amir Hossein Monshi, Justin Pearson
  11. Solving Hypertree Structured CSP: Sequential and Parallel Approaches
    Mohammed Lalou, Zineb Habbas, Kamal Amroun
  12. A Hybrid Solver for Large Neighborhood Search: Mixing Gecode and EasyLocal++
    Raffaele Cipriano, Luca Di Gaspero, Agostino Dovier
  13. Restoring CSP Satisfiability with MaxSAT
    Inês Lynce and Joao Marques-Silva
  14. Negotiation Exploiting Reasoning by Projections
    Toni Mancini
    Also appearing in Proceedings of the 7th International Conference on Practical Applications of Agents and Multi-Agent Systems (PAAMS 2009), volume 55 of Advances in Soft Computing, pages 329-338. Springer, 2009. DOI: 10.1007/978-3-642-00487-2_35
  15. A structural approach to reasoning with quantified Boolean formulas
    Luca Pulina and Armando Tacchella

04-Jun-2010: submitted by Marco Gavanelli and Toni Mancini
04-Jun-2010: published on CEUR-WS.org