Abstract

Stefano Bistarelli, Andrea Formisano, Marco Maratea (Eds.) Proceedings of the 23rd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion

-

RCR A 2016 Copyr ight c 2016 for the individual papers by the papers’ authors. Copying permitted for private and academic purposes. Re-publication of material from this volume requires permission by the copyright owners. This volume is published and copyrighted by its editors. This volume contains the p apers presented at RCRA 2016 , the 23rd RCRA International Workshop on “Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion” held on November 28, 2016 in Genova.

Since the 2005 edition, the RCRA workshops have focused on the theme of algorithms in artificial intelligence, proposing benchmarks to compare them and study their efficiency through experimental evaluation. Since then, the conference was organized in Udine (Italy), Reggio Emilia (Italy), Bologna (Italy), Barcelona (Spain), Rome (Italy), Vienna (Austria), Pisa (Italy), and Ferrara (Italy).

There were 13 submissions. Each submission was reviewed by at least four program committee members. The committee decided to accept all 13 papers for presentat ion at RCRA 2016 . Among them 7 are original papers and are included in this volume. We would like to thank Program Committee members and the external rev iewers of RCRA 2016 for their work, as well as to the authors who submitted their articles to the conference. We also would like to thank the Department of Informatics, Bioengineering, Robotics and Systems Engineering, DIBRIS, of the University of Genova and the organ izers of AI*IA 2016 , for host ing RCRA 2016 .

Finally we acknowledge the EasyChair team and CEUR-WS.org that helped us in organizing the conference and producing the proceedings.

November 2016 Genova

Stefano Bistarelli Andrea Formisano Marco Maratea i

Program Chairs

Stefano Bistarelli

Andrea Formisano Marco Maratea University of Perugia University of Perugia University of Genova

Program Committee

Mario Alviano

Roman Barta´k Stefano Bistarelli Pedro Cabalar Federico Chesani Stefania Costantini Alessandro Dal Palu` Luca Di Gaspero Carmine Dodaro Esra Erdem Wolfgang Faber Jorge Fandinno Andrea Formisano Martin Gebser Yuliya Lierler Toni Mancini Marco Maratea Joao Marques-Silva Angelo Oddi Gian Luca Pozzato Luca Pulina Francesco Scarcello Claudia Schulz Peter Schu¨ ller Ivan Serina Tran Cao Son Miroslaw Truszczyn´ ski Mauro Vallati Richard J. Wallace Johannes Wallner

Neng-Fa Zhou

Additional Reviewers

University of Calabria

Charles University in Prague University of Perugia University of Corun˜ a University of Bologna University of L’Aquila University of Parma University of Udine University of Calabria Sabanci University University of Huddersfield University of Corun˜ a University of Perugia University of Potsdam University of Nebraska at Omaha Sapienza University Roma University of Genova University of Lisbon ISTC-CNR, Roma University of Torino University of Sassari University of Calabria Imperial College London Marmara University University of Brescia New Mexico State University University of Kentucky University of Huddersfield University College Cork University of Helsinki CUNY Brooklyn College and Graduate Center

Gu¨ nther Charwat

Stefano Sinisi Roland Kaminski Benjamin Susman

Benjamin Kaufmann

Atena M. Tabakhi

Francesco Lupia ii

External propagators in WASP: preliminary report

Carmine Dodaro, Francesco Ricca, Peter Schu¨ller Learning with safety requirements: state of the art and open questions

Francesco Leofante, Luca Pulina, Armando Tacchella Computing the Shapley value in allocation problems: approximations and bounds, with an application to the Italian VQR research assessment program Francesco Lupia, Angelo Mendicelli, Andrea Ribichini,

Francesco Scarcello, Marco Schaerf

Automated benchmarking of KR-systems

Christoph Redl Adjudication of coreference annotations via finding optimal repairs of equivalence relations

Peter Schu¨ller Complexity analysis vs. engineering design in CSP algorithms: contravening conventional wisdom again

Richard J. Wallace Preprocessing versus search processing for constraint satisfaction problems Richard J. Wallace 1 11 27 45 57 73 89 CONTENTS Papers not included here and published elsewhere

References

Completion of disjunctive logic programs Mario Alviano, Carmine Dodaro . Appeared in S. Kambhampati, (Ed.) :Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016 , pp. 886 - 892 . AAAI Press

Anytime answer set optimization via unsatisfiable core shrinking Mario Alviano, Carmine Dodaro . Appeared in Theory and Practice of Logic Programming , 16 ( 5-6 ), pp. 533 - 551 , 2016 . Cambridge University Press

ASPQ: an ASP-based 2QBF solver Giovanni Amendola, Carmine Dodaro, Francesco Ricca . Appeared in Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016 ). CEUR Workshop Proceedings vol. 1719 , pp. 49 - 54 . 2016

A privacy-preserving model for the multi-agent propositional planning problem Andrea Bonisoli , Alfonso Emilio Gerevini, Alessandro Saetti, Ivan Serina . Appeared in Proceedings of the 2nd Workshop on Distributed and Multi-Agent Planning of 24th International Conference on Automated Planning and Scheduling , pp. 25 - 29 , 2014 .

I-DLV : the new intelligent grounder of DLV Francesco Calimeri , Davide Fusca`, Simona Perri , Jessica Zangari . Appeared in Proceedings of XV Conference of the Italian Association for Artificial Intelligence , AI*IA 2016 .

A Framework for easing the development of applications embedding answer set programming Davide Fusca` , Stefano Germano , Jessica Zangari, Marco Anastasio, Francesco Calimeri, Simona Perri . Appeared in Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming , PPDP 2016 , pp. 38 - 49 , 2016 . ACM