RCRA 2015 - Proceedings of the 22nd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion - September 22, 2015, Ferrara, Italy

Oct 4, 2026

RCRA 2015 proceedings compile the papers and editorial material for the 22nd RCRA International Workshop held in Ferrara, Italy on September 22, 2015. The volume organizes regular papers and also lists related work published elsewhere. Included topics cover experimental and theoretical aspects of algorithm evaluation for solving combinatorial-explosion problems, with emphasis on answer set programming (ASP) and related logic programming methods, planning, and satisfiability-based approaches. Front matter provides editors, program chairs, committee members, publication and copyright permissions.

LanguageEnglish

CategoryResearch & Report

FormatPDF

Pages96

Reading Time4 h 2 min

AccessFree to download

Regular Papers

Evaluating Answer Set Programming with Non-Convex Recursive Aggregates

JWASP: A New Java-Based ASP Solver

Searching for Sequential Plans Using Tabled Logic Programming

Testing Credulous and Sceptical Acceptance in Small-World Networks

Now or Never: Negotiating Efficiently with Unknown Counterparts

An Empirical Perspective on Ten Years of QBF Solving

Papers not included here and published elsewhere

A MaxSAT Algorithm Using Cardinality Constraints of Bounded Size

Stefano Bistarelli, Andrea Formisano, Marco Maratea (Eds.) RCRA 2015 Proceedings of the 22nd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion Ferrara, Italy, September 22, 2015 Copyright 􀀍c2015 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. Editors' address: Universit di Perugia Dipartimento di Matematica e Informatica Via Vanvitelli 1 06123 Perugia, Italy fstefano.bistarelli [j](j andrea.formisanog@unipg.it)[ andrea.formisano](j andrea.formisanog@unipg.it)[g](j andrea.formisanog@unipg.it)[@unipg.it](j andrea.formisanog@unipg.it)[ ](j andrea.formisanog@unipg.it)Universit di Genova Dipartimento di Informatica, Bioingegneria, Robotica e Ingegneria dei Sistemi viale F. Causa,15 16145 Genova, Italy [marco@dibris.unige.it](marco@dibris.unige.it) Program Chairs Stefano Bistarelli Andrea Formisano Marco Maratea Universit di Perugia Universit di Perugia Universit di Genova Program Committee Mario Alviano Paolo Baldan Marcello Balduccini Laura Barbulescu Roman Bartak Elena Bellodi Stefano Bistarelli Stefania Costantini Agostino Dovier Andrea Formisano Fabio Gadducci Marco Gavanelli Matti Jrvisalo Zeynep Kiziltan Ines Lynce Daniele Magazzeni Toni Mancini Marco Maratea Joao Marques-Silva Angelo Oddi Luca Pulina Francesco Ricca Francesco Santini Torsten Schaub Ivan Serina Thomas St¨utzle Mauro Vallati Richard Wallace Johannes Wallner Universit della Calabria Universit di Padova Drexel University Carnegie Mellon University Charles University in Prague Universit di Ferrara Universit di Perugia Universit di L'Aquila Universit di Udine Universit di Perugia Universit di Pisa Universit di Ferrara University of Helsinki Universit di Bologna University of Lisbon King's College London Sapienza Universit Roma Universit di Genova University of Lisbon ISTI-CNR Universit di Sassari Universit della Calabria Universit di Perugia University of Potsdam Universit di Brescia Universit Libre de Bruxelles University of Huddersﬁeld University College Cork University of Helsinki Contents Regular Papers Evaluating Answer Set Programming with Non-Convex Recursive Aggregates Mario Alviano JWASP: A New Java-Based ASP Solver Mario Alviano, Carmine Dodaro, and Francesco Ricca Searching for Sequential Plans Using Tabled Logic Programming Roman Barta´k, Jindrˇich Vodra´ka Testing Credulous and Sceptical Acceptance in Small-World Networks Stefano Bistarelli, Fabio Rossi, Francesco Santini Now or Never: Negotiating Efﬁciently with Unknown Counterparts Toni Mancini An Empirical Perspective on Ten Years of QBF Solving Paolo Marin, Massimo Narizzano, Luca Pulina, Armando Tacchella, Enrico Giunchiglia 1 16 24 39 47 62 Modeling Abduction over Acyclic First-Order Logic Horn Theories in Answer Set Programming: Preliminary Experiments Peter Schu¨ller 76 Papers not included here and published elsewhere A MaxSAT Algorithm Using Cardinality Constraints of Bounded Size Mario Alviano, Carmine Dodaro, Francesco Ricca. Appeared in Q. Yang and M. Wooldridge (Eds.): Proceedings of the Twenty-Fourth International Joint Conference on Artiﬁcial Intelligence, IJCAI 2015, pp. 2677– 2683. AAAI Press Fuzzy Answer Set Computation via Satisﬁability Modulo Theories Mario Alviano, Rafael Pen˜aloza. Appeared in Theory and Practice of Logic Programming, 15(4 -5), pp. 588-603, 2015. Cambridge University Press Planning with Always Preferences by Compilation into STRIPS with Action Costs Luca Ceriani, Alfonso E. Gerevini. Appeared in L. Lelis and R. Stern (Eds.): Proceedings of the Eighth Annual Symposium on Combinatorial Search, SOCS 2015, pp. 161-165. AAAI Press ASCoL: a Tool for Improving Automatic Planning Domain

FAQs

What conference and year does the proceedings volume cover?

The volume covers RCRA 2015, the 22nd RCRA International Workshop held on September 22, 2015 in Ferrara, Italy.

What kinds of research topics are included in the regular papers section?

The regular papers focus on experimental evaluation and algorithmic methods for combinatorial-explosion problems, with substantial coverage of answer set programming, logic programming, planning, and related reasoning approaches.

Does the volume include papers published elsewhere?

Yes. A dedicated section lists papers not included in the main volume but published elsewhere, including references to IJCAI 2015, Theory and Practice of Logic Programming, and other venues.

Oct 4, 2026

Upload by RuangKosong