<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta />
    <article-meta>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <volume>17</volume>
      <fpage>14</fpage>
      <lpage>15</lpage>
      <abstract>
        <p>Proceedings of the 24th RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion 2017 (RCRA 2017)</p>
      </abstract>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>RCRA 2017</p>
      <p>Copyright c 2017 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 contains the papers presented at RCRA 2017, the 24th RCRA International
Workshop on Experimental Evaluation of Algorithms for Solving Problems with
Combinatorial Explosion (http://rcra.aixia.it/rcra2017), held within the XVI
Conference of the Italian Association for Artificial Intelligence (AI*IA 2017), in Bari,
Italy, on November 14-15, 2017.</p>
      <p>Since the 2007 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 workshop was organized in Udine (Italy),
Reggio Emilia (Italy), Bologna (Italy), Barcelona (Spain), Rome (Italy), Vienna (Austria),</p>
    </sec>
    <sec id="sec-2">
      <title>Pisa (Italy), Ferrara (Italy) and Genova (Italy).</title>
      <p>There were 12 submissions. Each submission was reviewed by at least three program
committee members. The committee decided to accept all 12 papers for presentation at
RCRA 2017. Among them 5 are original papers and are included in this volume.
We would like to thank Program Committee members and the external reviewers of RCRA
2017 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 Computer Science, at the University of</p>
    </sec>
    <sec id="sec-3">
      <title>Bari and the organizers of AI*IA 2017, for hosting RCRA 2017. Finally we acknowledge the EasyChair team and CEUR-WS.org that helped us in organizing the conference and producing the proceedings.</title>
    </sec>
    <sec id="sec-4">
      <title>November 2017</title>
    </sec>
    <sec id="sec-5">
      <title>Bari i</title>
    </sec>
    <sec id="sec-6">
      <title>Marco Maratea, Ivan Serina</title>
    </sec>
    <sec id="sec-7">
      <title>Workshop Organizers</title>
      <sec id="sec-7-1">
        <title>Programme Chairs</title>
      </sec>
    </sec>
    <sec id="sec-8">
      <title>Maratea, Marco</title>
    </sec>
    <sec id="sec-9">
      <title>Serina, Ivan</title>
      <sec id="sec-9-1">
        <title>Programme Committee</title>
      </sec>
    </sec>
    <sec id="sec-10">
      <title>Alviano, Mario</title>
    </sec>
    <sec id="sec-11">
      <title>Bistarelli, Stefano</title>
    </sec>
    <sec id="sec-12">
      <title>Cabalar, Pedro</title>
    </sec>
    <sec id="sec-13">
      <title>Ceberio, Martine</title>
    </sec>
    <sec id="sec-14">
      <title>Chesani, Federico</title>
    </sec>
    <sec id="sec-15">
      <title>Costantini, Stefania</title>
    </sec>
    <sec id="sec-16">
      <title>Di Gaspero, Luca</title>
    </sec>
    <sec id="sec-17">
      <title>Dodaro, Carmine</title>
    </sec>
    <sec id="sec-18">
      <title>Faber, Wolfgang</title>
    </sec>
    <sec id="sec-19">
      <title>Fandinno, Jorge</title>
    </sec>
    <sec id="sec-20">
      <title>Formisano, Andrea</title>
    </sec>
    <sec id="sec-21">
      <title>Gadducci, Fabio</title>
    </sec>
    <sec id="sec-22">
      <title>Gavanelli, Marco</title>
    </sec>
    <sec id="sec-23">
      <title>Ja¨rvisalo, Matti</title>
    </sec>
    <sec id="sec-24">
      <title>Kiziltan, Zeynep</title>
    </sec>
    <sec id="sec-25">
      <title>Mancini, Toni</title>
    </sec>
    <sec id="sec-26">
      <title>Marques-Silva, Joao</title>
    </sec>
    <sec id="sec-27">
      <title>Oddi, Angelo</title>
    </sec>
    <sec id="sec-28">
      <title>Pozzato, Gian Luca</title>
    </sec>
    <sec id="sec-29">
      <title>Pulina, Luca</title>
    </sec>
    <sec id="sec-30">
      <title>Ricca, Francesco</title>
    </sec>
    <sec id="sec-31">
      <title>Santini, Francesco</title>
    </sec>
    <sec id="sec-32">
      <title>Schaub, Torsten</title>
    </sec>
    <sec id="sec-33">
      <title>Schulz, Claudia</title>
    </sec>
    <sec id="sec-34">
      <title>Schu¨ ller, Peter</title>
    </sec>
    <sec id="sec-35">
      <title>Stu¨ tzle, Thomas</title>
    </sec>
    <sec id="sec-36">
      <title>Torroni, Paolo</title>
    </sec>
    <sec id="sec-37">
      <title>Truszczynski, Mirek</title>
    </sec>
    <sec id="sec-38">
      <title>Vallati, Mauro</title>
    </sec>
    <sec id="sec-39">
      <title>Wallace, Richard</title>
    </sec>
    <sec id="sec-40">
      <title>Wallner, Johannes P.</title>
    </sec>
    <sec id="sec-41">
      <title>Woltra, Stefan</title>
    </sec>
    <sec id="sec-42">
      <title>Zhou, Neng-Fa</title>
    </sec>
    <sec id="sec-43">
      <title>University of Genova</title>
    </sec>
    <sec id="sec-44">
      <title>University of Brescia</title>
      <p>The ingredients of the argumentation reasoner pyglaf: python, circumscription,
and glucose to taste</p>
      <p>Mario Alviano</p>
      <sec id="sec-44-1">
        <title>Expansion-based QBF Solving on Tree Decompositions</title>
        <p>Gu¨nther Charwat, Stefan Woltran
I-DLV+MS : preliminary report on an automatic ASP solver selector</p>
        <p>Davide Fusca`, Francesco Calimeri, Jessica Zangari, Simona Perri</p>
      </sec>
      <sec id="sec-44-2">
        <title>On the Quest for an Acyclic Graph</title>
        <p>Mikolas Janota, Radu Grigore, Vasco Manquinho</p>
      </sec>
      <sec id="sec-44-3">
        <title>On Minimal Corrections in ASP</title>
        <p>Mikolas Janota and Joao Marques-Silva
1
16
31
41
56
Papers not included here and published elsewhere
Answer Set Enumeration via Assumption Literals information on submission
Mario Alviano, Carmine Dodaro.</p>
        <p>Appeared in the Proceedings of the XVth International Conference of the Italian
Association for Artificial Intelligence (AI*IA 2016). Genova, Italy, November 29
- December 1, 2016, vol. 10037 of Lecture Notes in Computer Science, pages
149–163. Springer, 2016.</p>
        <p>Algebraic Particle Swarm Optimization for the Permutations Search Space
information on submission
Marco Baioletti, Alfedo Milani, Valentino Santucci .</p>
        <p>Appeared in the Proceedings of the 2017 IEEE Congress on Evolutionary
Computation (CEC), pages 1587–1594, June 2017.</p>
      </sec>
      <sec id="sec-44-4">
        <title>A Crisp and Soft Library for Abstract Argumentation</title>
        <p>Stefano Bistarelli, Fabio Rossi, Francesco Santini .</p>
        <p>Appeared in the Proceedings of the 29th IEEE International Conference on Tools
with Artificial Intelligence, ICTAI. IEEE Computer Society, 2017
Constraints, Lazy Constraints, or Propagators in ASP Solving: An Empirical
CONTENTS</p>
      </sec>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          <article-title>Planning with Always Preferences by Compilation into STRIPS with Action Costs Luca Ceriani, Alfonso Emilio Gerevini</article-title>
          .
          <source>Appeared in the Proceedings of the Eighth Annual Symposium on Combinatorial Search, SOCS</source>
          <year>2015</year>
          ,
          <volume>11</volume>
          -
          <fpage>13</fpage>
          June 2015, Ein Gedi, the Dead Sea, Israel., pages
          <fpage>161</fpage>
          -
          <lpage>165</lpage>
          . AAAI Press,
          <year>2015</year>
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          <article-title>Multi-Objective Optimization in a Job Shop with Energy Costs through Hybrid Evolutionary Techniques Miguel A´ngel Gonza´lez Ferna´ndez, Angelo Oddi, Riccardo Rasconi</article-title>
          .
          <source>Appeared in the Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling</source>
          ,
          <string-name>
            <surname>ICAPS</surname>
          </string-name>
          <year>2017</year>
          , Pittsburgh, Pennsylvania, USA, June 18-23, pages
          <fpage>140</fpage>
          -
          <lpage>148</lpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          <string-name>
            <given-names>Compressed</given-names>
            <surname>Path</surname>
          </string-name>
          <article-title>Databases with Ordered Wildcard Substitutions information on submission Matteo Salvetti</article-title>
          , Adi Botea, Alessandro Saetti,
          <source>Alfonso Emilio Gerevini. Appeared in the Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling</source>
          ,
          <string-name>
            <surname>ICAPS</surname>
          </string-name>
          <year>2017</year>
          , Pittsburgh, Pennsylvania, USA, June 18-23, pages
          <fpage>250</fpage>
          -
          <lpage>258</lpage>
          ,
          <year>2017</year>
          .
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>