<!DOCTYPE html>
<!-- CEURVERSION=2015-12-02 -->
<html lang="en">
<head>
<meta http-equiv="Content-type" content="text/html;charset=utf-8">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<link rel="stylesheet" type="text/css" href="../ceur-ws.css">
<link rel="stylesheet" type="text/css" href="../aixia.css">
<title>CEUR-WS.org/Vol-AIXIA - 23rd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion 2016</title>
</head>
<!--CEURLANG=eng -->
<body>



<table style="border: 0; border-spacing: 0; border-collapse: collapse; width: 95%">
<tbody><tr>
<td style="text-align: left; vertical-align: middle">
<a href="http://ceur-ws.org/"><div id="CEURWSLOGO"></div></a>
</td>
<td style="text-align: left; vertical-align: middle">
<a href="http://ceur-ws.org/aixia.html"><div id="AIXIALOGO"></div></a>
</td>
<td style="text-align: right; vertical-align: middle">

<span class="CEURVOLNR">Vol-XXX</span> <br>
<span class="CEURURN">urn:nbn:de:0074-XXX-C</span>
<p class="unobtrusive copyright" style="text-align: justify">Copyright &copy; 
<span class="CEURPUBYEAR">2016</span> for the individual papers
by the papers' authors. Copying permitted for private and academic purposes.
This volume is published and copyrighted by its editors.</p>
</td>
</tr>
</tbody></table>

<hr>

<br><br><br>

<h1><a href="http://rcra.aixia.it/rcra2016"><span class="CEURVOLACRONYM">RCRA 2016</span></a><br>
<span class="CEURVOLTITLE">International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion</span></h1>
<br>

<h3>
<span class="CEURFULLTITLE">Proceedings of the 23rd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion 2016 (RCRA 2016)</span><br>
A workshop of the XV International Conference of the Italian Association for Artificial Intelligence (<span class="CEURCOLOCATED">AI*IA 2016</span>)<br>
</h3>
<h3><span class="CEURLOCTIME">Genova, Italy, November 28, 2016</span>.</h3> 
<br>
<b> Edited by </b>
<p>

</p><h3>
   <a href="http://www.dmi.unipg.it/bista/"><span class="CEURVOLEDITOR">Stefano Bistarelli</span></a> *<br>
   <a href="http://www.dmi.unipg.it/formis"><span class="CEURVOLEDITOR">Andrea Formisano</span></a> *<br>
   <a href="http://www.dibris.unige.it/en/maratea-marco"><span class="CEURVOLEDITOR">Marco Maratea</span></a> **<br>
</h3>

* <a href="http://www.unipg.it/">University of Perugia</a>,
  Department of Mathematics and Computer Science, via Vanvitelli 1, 06123 Perugia, Italy<br>
** <a href="http://www.unige.it/">University of Genova</a>,
  Department of Informatics, Bioengineering, Robotics and System engineering, viale F. Causa 15, 16145 Genova, Italy<br>
  <br>

<hr>

<br><br><br>



<div class="CEURTOC">
<h2> Table of Contents </h2>
<ul>
<li id="preface"><a href="preface.pdf">
<span class="CEURTITLE">Preface</span></a> 
</li>
</ul>


<h3><span class="CEURSESSION">Regular papers</span></h3>

<ul>
<li id="paper1"><a href="paper1.pdf">
<span class="CEURTITLE">External propagators in WASP: preliminary report</span></a>
<span class="CEURPAGES">1-9</span> <br>
<span class="CEURAUTHORS">Carmine Dodaro, Francesco Ricca, Peter Sch&uuml;ller</span>
</li>

<li id="paper2"><a href="paper2.pdf">
<span class="CEURTITLE">Learning with safety requirements: state of the art and open questions</span></a>
<span class="CEURPAGES">11-25</span> <br>
<span class="CEURAUTHORS">Francesco Leofante, Luca Pulina, Armando Tacchella</span>
</li>


<li id="paper3"><a href="paper3.pdf">
<span class="CEURTITLE">Computing the Shapley value in allocation problems: approximations and bounds, with an application to the Italian VQR research assessment program</span></a>
<span class="CEURPAGES">27-43</span> <br>
<span class="CEURAUTHORS">Francesco Lupia, Angelo Mendicelli, Andrea Ribichini, Francesco Scarcello, Marco Schaerf</span>
</li>

<li id="paper4"><a href="paper4.pdf">
<span class="CEURTITLE">Automated benchmarking of KR-systems</span></a>
<span class="CEURPAGES">45-56</span> <br>
<span class="CEURAUTHORS">Christoph Redl</span>
</li>

<li id="paper5"><a href="paper5.pdf">
<span class="CEURTITLE">Adjudication of coreference annotations via finding optimal repairs of equivalence relations</span></a>
<span class="CEURPAGES">57-71</span> <br>
<span class="CEURAUTHORS">Peter Sch&uuml;ller</span>
</li>

<li id="paper6"><a href="paper6.pdf">
<span class="CEURTITLE">Complexity analysis vs. engineering design in CSP algorithms: contravening conventional wisdom again</span></a>
<span class="CEURPAGES">73-87</span> <br>
<span class="CEURAUTHORS">Richard J. Wallace</span>
</li>

<li id="paper7"><a href="paper7.pdf">
<span class="CEURTITLE">Preprocessing versus search processing for constraint satisfaction problems</span></a>
<span class="CEURPAGES">89-103</span> <br>
<span class="CEURAUTHORS">Richard J. Wallace</span>
</li>

</ul>




</div>


<hr>
<span class="unobtrusive">
2016-11-21: submitted by Andrea Formisano, 
            metadata incl. bibliographic data published under <A HREF="http://creativecommons.org/publicdomain/zero/1.0/">Creative Commons CC0</A><br>
<span class="CEURPUBDATE">yyyy-mm-dd</span>: published on CEUR-WS.org 
	|<A HREF="https://validator.w3.org/nu/?doc=http%3A%2F%2Fceur-ws.org%2FVol-XXX%2F">valid HTML5</A>|
</span>
</body></html>

