<?xml version="1.0" encoding="UTF-8"?>
<TEI xml:space="preserve" xmlns="http://www.tei-c.org/ns/1.0" 
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" 
xsi:schemaLocation="http://www.tei-c.org/ns/1.0 https://raw.githubusercontent.com/kermitt2/grobid/master/grobid-home/schemas/xsd/Grobid.xsd"
 xmlns:xlink="http://www.w3.org/1999/xlink">
	<teiHeader xml:lang="en">
		<fileDesc>
			<titleStmt>
				<title level="a" type="main">Copyright c �2017 for the individual papers by the papers&apos; authors. Copying permitted for private and academic purposes. Re-publication of material from this volume requires permission by the copyright owners</title>
			</titleStmt>
			<publicationStmt>
				<publisher/>
				<availability status="unknown"><licence/></availability>
			</publicationStmt>
			<sourceDesc>
				<biblStruct>
					<analytic>
						<author>
							<affiliation key="aff0">
								<orgName type="department" key="dep1">Dipartimento di Informatica</orgName>
								<orgName type="department" key="dep2">Bioingegneria</orgName>
								<orgName type="institution" key="instit1">Università degli Studi di Genova</orgName>
								<orgName type="institution" key="instit2">Robotica e Ingegneria dei Sistemi</orgName>
								<address>
									<addrLine>viale F. Causa</addrLine>
									<postCode>15, 16145</postCode>
									<settlement>Genova</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<author>
							<affiliation key="aff1">
								<orgName type="department">Dipartimento di Ingegneria dell&apos;Informazione Via Branze</orgName>
								<orgName type="institution">Università degli Studi di Brescia</orgName>
								<address>
									<postCode>38, 25123</postCode>
									<settlement>Brescia</settlement>
									<country key="IT">Italy</country>
								</address>
							</affiliation>
						</author>
						<title level="a" type="main">Copyright c �2017 for the individual papers by the papers&apos; authors. Copying permitted for private and academic purposes. Re-publication of material from this volume requires permission by the copyright owners</title>
					</analytic>
					<monogr>
						<imprint>
							<date/>
						</imprint>
					</monogr>
					<idno type="MD5">4E787BC1B917A9CDB5B93D391A363B3F</idno>
				</biblStruct>
			</sourceDesc>
		</fileDesc>
		<encodingDesc>
			<appInfo>
				<application version="0.7.2" ident="GROBID" when="2023-03-24T08:19+0000">
					<desc>GROBID - A machine learning software for extracting information from scholarly documents</desc>
					<ref target="https://github.com/kermitt2/grobid"/>
				</application>
			</appInfo>
		</encodingDesc>
		<profileDesc>
			<abstract/>
		</profileDesc>
	</teiHeader>
	<text xml:lang="en">
		<body>
<div xmlns="http://www.tei-c.org/ns/1.0"><head>Preface</head><p>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), Pisa (Italy), Ferrara (Italy) and Genova (Italy).</p><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.</p><p>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.</p><p>We also would like to thank the Department of Computer Science, at the University of Bari and the organizers of AI*IA 2017, for hosting RCRA 2017.</p><p>Finally we acknowledge the EasyChair team and CEUR-WS.org that helped us in organizing the conference and producing the proceedings. </p></div><figure xmlns="http://www.tei-c.org/ns/1.0" type="table" xml:id="tab_0"><head></head><label></label><figDesc>Crisp and Soft Library for Abstract Argumentation Stefano Bistarelli, Fabio Rossi, Francesco Santini . 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</figDesc><table><row><cell>Contents</cell><cell></cell></row><row><cell>Regular Papers</cell><cell></cell></row><row><cell>The ingredients of the argumentation reasoner pyglaf: python, circumscription, and glucose to taste Mario Alviano</cell><cell>1</cell></row><row><cell>Expansion-based QBF Solving on Tree Decompositions Günther Charwat, Stefan Woltran</cell><cell>16</cell></row><row><cell>I-DLV+MS : preliminary report on an automatic ASP solver selector Davide Fuscà, Francesco Calimeri, Jessica Zangari, Simona Perri</cell><cell>31</cell></row><row><cell>On the Quest for an Acyclic Graph Mikolas Janota, Radu Grigore, Vasco Manquinho</cell><cell>41</cell></row><row><cell>On Minimal Corrections in ASP Mikolas Janota and Joao Marques-Silva</cell><cell>56</cell></row><row><cell>Papers not included here and published elsewhere</cell><cell></cell></row><row><cell>Answer Set Enumeration via Assumption Literals information on submission Mario Alviano, Carmine Dodaro.</cell><cell></cell></row><row><cell>Appeared in the Proceedings of the XVth International Conference of the Italian Association for Artificial Intelligence (AI*IA 2016). Genova, Italy, November 29</cell><cell></cell></row><row><cell>-December 1, 2016, vol. 10037 of Lecture Notes in Computer Science, pages 149-163. Springer, 2016.</cell><cell></cell></row><row><cell>Algebraic Particle Swarm Optimization for the Permutations Search Space infor-mation on submission Marco Baioletti, Alfedo Milani, Valentino Santucci .</cell><cell></cell></row><row><cell>November 2017 Bari Appeared in the Proceedings of the 2017 IEEE Congress on Evolutionary Com-putation (CEC), pages 1587-1594, June 2017.</cell><cell></cell></row><row><cell>Marco Maratea, Ivan Serina</cell><cell></cell></row><row><cell>Workshop Organizers</cell><cell></cell></row><row><cell>i</cell><cell></cell></row></table><note>A</note></figure>
		</body>
		<back>

			<div type="acknowledgement">
<div xmlns="http://www.tei-c.org/ns/1.0"><p>Programme Chairs Maratea, Marco University of Genova Serina, Ivan University of Brescia Programme Committee Alviano, Mario University of Calabria Bistarelli, Stefano Università di Perugia Cabalar, Pedro University of Corunna Ceberio, Martine University of Texas at El Paso Chesani, Federico University of Bologna Costantini, Stefania University of L'Aquila Di Gaspero, Luca University of Udine Dodaro, Carmine University of Genova Faber, Wolfgang University of Huddersfield Fandinno, Jorge Coruña University Formisano, Andrea University of Perugia Gadducci, Fabio University of Pisa Gavanelli, Marco University of Ferrara Järvisalo, Matti University of Helsinki Kiziltan, Zeynep University of Bologna Mancini, Toni Sapienza University Marques-Silva, Joao University of Lisbon Oddi, Angelo ISTC-CNR Pozzato, Gian Luca University of Torino Pulina, Luca University of Sassari Ricca, Francesco University of Calabria Santini, Francesco University of Perugia Schaub, Torsten University of Potsdam Schulz, Claudia TU Darmstadt Schüller, Peter Marmara University Stützle, Thomas Université Libre de Bruxelles Torroni, Paolo University of Bologna Truszczynski, Mirek University of Kentucky Vallati, Mauro University of Huddersfield Wallace, Richard University College Cork Wallner, Johannes P. University of Helsinki Woltra, Stefan TU Wien Zhou, Neng-Fa CUNY Brooklyn College and Graduate Center</p></div>
			</div>

			<div type="references">

				<listBibl>

<biblStruct xml:id="b0">
	<analytic>
		<title level="a" type="main">Planning with Always Preferences by Compilation into STRIPS with Action Costs Luca Ceriani, Alfonso Emilio Gerevini</title>
		<author>
			<persName><forename type="first">Analysis</forename><surname>Bernardo Cuteri</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Carmine</forename><surname>Dodaro</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Francesco</forename><surname>Ricca</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Peter</forename><surname>Schüller</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Appeared in the Proceedings of the Eighth Annual Symposium on Combinatorial Search, SOCS 2015</title>
				<meeting><address><addrLine>Ein Gedi, the Dead Sea, Israel</addrLine></address></meeting>
		<imprint>
			<publisher>AAAI Press</publisher>
			<date type="published" when="2015">2017. June 2015. 2015</date>
			<biblScope unit="volume">17</biblScope>
			<biblScope unit="page" from="161" to="165" />
		</imprint>
	</monogr>
	<note>Appeared in Theory and Practice of Logic Programming</note>
</biblStruct>

<biblStruct xml:id="b1">
	<analytic>
		<title level="a" type="main">Multi-Objective Optimization in a Job Shop with Energy Costs through Hybrid Evolutionary Techniques</title>
		<author>
			<persName><forename type="first">Miguel</forename><surname>Ángel</surname></persName>
		</author>
		<author>
			<persName><forename type="first">González</forename><surname>Fernández</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Angelo</forename><surname>Oddi</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Riccardo</forename><surname>Rasconi</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Appeared in the Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, ICAPS 2017</title>
				<meeting><address><addrLine>Pittsburgh, Pennsylvania, USA</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2017">June 18-23. 2017</date>
			<biblScope unit="page" from="140" to="148" />
		</imprint>
	</monogr>
</biblStruct>

<biblStruct xml:id="b2">
	<analytic>
		<title level="a" type="main">Compressed Path Databases with Ordered Wildcard Substitutions information on submission</title>
		<author>
			<persName><forename type="first">Matteo</forename><surname>Salvetti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Adi</forename><surname>Botea</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Alessandro</forename><surname>Saetti</surname></persName>
		</author>
		<author>
			<persName><forename type="first">Alfonso</forename><forename type="middle">Emilio</forename><surname>Gerevini</surname></persName>
		</author>
	</analytic>
	<monogr>
		<title level="m">Appeared in the Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, ICAPS 2017</title>
				<meeting><address><addrLine>Pittsburgh, Pennsylvania, USA</addrLine></address></meeting>
		<imprint>
			<date type="published" when="2017">June 18-23. 2017</date>
			<biblScope unit="page" from="250" to="258" />
		</imprint>
	</monogr>
</biblStruct>

				</listBibl>
			</div>
		</back>
	</text>
</TEI>
