<h2>LIPIcs, Volume 17, ICLP 2012</h2>
<ul>
<li>
<span class="authors">Agostino Dovier and Vítor Santos Costa</span>
<span class="title">LIPIcs, Volume 17, ICLP'12, Complete Volume</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012">10.4230/LIPIcs.ICLP.2012</a>
</li>
<li>
<span class="authors">Agostino Dovier and Vítor Santos Costa</span>
<span class="title">Frontmatter, Table of Contents, List of Authors</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.i">10.4230/LIPIcs.ICLP.2012.i</a>
</li>
<li>
<span class="authors">Agostino Dovier and Vítor Santos Costa</span>
<span class="title">Introduction to the Technical Communications of the 28th International Conference on Logic Programming Special Issue</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.xvii">10.4230/LIPIcs.ICLP.2012.xvii</a>
</li>
<li>
<span class="authors">François Bry and Sebastian Schaffert</span>
<span class="title">Simulation Unification: Beyond Querying Semistructured Data (Invited Talk)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.1">10.4230/LIPIcs.ICLP.2012.1</a>
</li>
<li>
<span class="authors">Hendrik Blockeel, Bart Bogaerts, Maurice Bruynooghe, Broes De Cat, Stef De Pooter, Marc Denecker, Anthony Labarre, Jan Ramon, and Sicco Verwer</span>
<span class="title">Modeling Machine Learning and Data Mining Problems with FO(·)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.14">10.4230/LIPIcs.ICLP.2012.14</a>
</li>
<li>
<span class="authors">Chitta Baral, Nguyen Ha Vo, and Shanshan Liang</span>
<span class="title">Answering Why and How questions with respect to a frame-based knowledge base: a preliminary report</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.26">10.4230/LIPIcs.ICLP.2012.26</a>
</li>
<li>
<span class="authors">Marco Maratea, Luca Pulina, and Francesco Ricca</span>
<span class="title">Applying Machine Learning Techniques to ASP Solving</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.37">10.4230/LIPIcs.ICLP.2012.37</a>
</li>
<li>
<span class="authors">Marcello Balduccini</span>
<span class="title">An Answer Set Solver for non-Herbrand Programs: Progress Report</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.49">10.4230/LIPIcs.ICLP.2012.49</a>
</li>
<li>
<span class="authors">Joohyung Lee and Yunsong Meng</span>
<span class="title">Stable Models of Formulas with Generalized Quantifiers (Preliminary Report)</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.61">10.4230/LIPIcs.ICLP.2012.61</a>
</li>
<li>
<span class="authors">Florian Schanda and Martin Brain</span>
<span class="title">Using Answer Set Programming in the Development of Verified Software</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.72">10.4230/LIPIcs.ICLP.2012.72</a>
</li>
<li>
<span class="authors">Mutsunori Banbara, Naoyuki Tamura, and Katsumi Inoue</span>
<span class="title">Generating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.86">10.4230/LIPIcs.ICLP.2012.86</a>
</li>
<li>
<span class="authors">Elvira Albert, Puri Arenas, and Miguel Gómez-Zamalloa</span>
<span class="title">Towards Testing Concurrent Objects in CLP</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.98">10.4230/LIPIcs.ICLP.2012.98</a>
</li>
<li>
<span class="authors">Slim Abdennadher and Nada Sharaf</span>
<span class="title">Visualization of CHR through Source-to-Source Transformation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.109">10.4230/LIPIcs.ICLP.2012.109</a>
</li>
<li>
<span class="authors">Zsolt Zombori, János Csorba, and Péter Szeredi</span>
<span class="title">Static Type Inference for the Q language using Constraint Logic Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.119">10.4230/LIPIcs.ICLP.2012.119</a>
</li>
<li>
<span class="authors">Michael Hanus</span>
<span class="title">Improving Lazy Non-Deterministic Computations by Demand Analysis</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.130">10.4230/LIPIcs.ICLP.2012.130</a>
</li>
<li>
<span class="authors">Giovanni Bacci, Marco Comini, Marco A. Feliú, and Alicia Villanueva</span>
<span class="title">The additional difficulties for the automatic synthesis of specifications posed by logic features in functional-logic languages</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.144">10.4230/LIPIcs.ICLP.2012.144</a>
</li>
<li>
<span class="authors">Rafael del Vado Vírseda, Fernando Pérez Morente, and Marcos Miguel García Toledo</span>
<span class="title">A Concurrent Operational Semantics for Constraint Functional Logic Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.154">10.4230/LIPIcs.ICLP.2012.154</a>
</li>
<li>
<span class="authors">Bryan Silverthorn, Yuliya Lierler, and Marius Schneider</span>
<span class="title">Surviving Solver Sensitivity: An ASP Practitioner’s Guide</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.164">10.4230/LIPIcs.ICLP.2012.164</a>
</li>
<li>
<span class="authors">Holger Hoos, Roland Kaminski, Torsten Schaub, and Marius Schneider</span>
<span class="title">aspeed: ASP-based Solver Scheduling</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.176">10.4230/LIPIcs.ICLP.2012.176</a>
</li>
<li>
<span class="authors">Christian Drescher and Toby Walsh</span>
<span class="title">Answer Set Solving with Lazy Nogood Generation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.188">10.4230/LIPIcs.ICLP.2012.188</a>
</li>
<li>
<span class="authors">Broes De Cat, Marc Denecker, and Peter Stuckey</span>
<span class="title">Lazy Model Expansion by Incremental Grounding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.201">10.4230/LIPIcs.ICLP.2012.201</a>
</li>
<li>
<span class="authors">Benjamin Andres, Benjamin Kaufmann, Oliver Matheis, and Torsten Schaub</span>
<span class="title">Unsatisfiability-based optimization in clasp</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.211">10.4230/LIPIcs.ICLP.2012.211</a>
</li>
<li>
<span class="authors">Johannes Oetsch, Jörg Pührer, and Hans Tompits</span>
<span class="title">An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.222">10.4230/LIPIcs.ICLP.2012.222</a>
</li>
<li>
<span class="authors">Jia-Huai You, John Morris, and Yi Bi</span>
<span class="title">Reconciling Well-Founded Semantics of DL-Programs and Aggregate Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.235">10.4230/LIPIcs.ICLP.2012.235</a>
</li>
<li>
<span class="authors">Michael Morak and Stefan Woltran</span>
<span class="title">Preprocessing of Complex Non-Ground Rules in Answer Set Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.247">10.4230/LIPIcs.ICLP.2012.247</a>
</li>
<li>
<span class="authors">Vladimir Lifschitz</span>
<span class="title">Two-Valued Logic Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.259">10.4230/LIPIcs.ICLP.2012.259</a>
</li>
<li>
<span class="authors">Juan Carlos Nieves and Helena Lindgren</span>
<span class="title">Possibilistic Nested Logic Programs</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.267">10.4230/LIPIcs.ICLP.2012.267</a>
</li>
<li>
<span class="authors">Marc Denecker, Yuliya Lierler, Miroslaw Truszczynski, and Joost Vennekens</span>
<span class="title">A Tarskian Informal Semantics for Answer Set Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.277">10.4230/LIPIcs.ICLP.2012.277</a>
</li>
<li>
<span class="authors">Felicidad Aguado, Pedro Cabalar, Martín Diéguez, Gilberto Pérez, and Concepción Vidal</span>
<span class="title">Paving the Way for Temporal Grounding</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.290">10.4230/LIPIcs.ICLP.2012.290</a>
</li>
<li>
<span class="authors">Wlodzimierz Drabent</span>
<span class="title">Logic + control: An example</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.301">10.4230/LIPIcs.ICLP.2012.301</a>
</li>
<li>
<span class="authors">Paul Tarau</span>
<span class="title">Deriving a Fast Inverse of the Generalized Cantor N-tupling Bijection</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.312">10.4230/LIPIcs.ICLP.2012.312</a>
</li>
<li>
<span class="authors">Sergio Greco, Francesca Spezzano, and Irina Trubitsyna</span>
<span class="title">On the Termination of Logic Programs with Function Symbols</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.323">10.4230/LIPIcs.ICLP.2012.323</a>
</li>
<li>
<span class="authors">Emilio Jesús Gallego Arias and James B. Lipton</span>
<span class="title">Logic Programming in Tabular Allegories</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.334">10.4230/LIPIcs.ICLP.2012.334</a>
</li>
<li>
<span class="authors">Taisuke Sato and Philipp Meyer</span>
<span class="title">Tabling for infinite probability computation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.348">10.4230/LIPIcs.ICLP.2012.348</a>
</li>
<li>
<span class="authors">Tiep Le, Hieu Nguyen, Enrico Pontelli, and Tran Cao Son</span>
<span class="title">ASP at Work: An ASP Implementation of PhyloWS</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.359">10.4230/LIPIcs.ICLP.2012.359</a>
</li>
<li>
<span class="authors">Veronica Dahl, Bradley Coleman, J. Emilio Miralles, and Erez Maharshak</span>
<span class="title">CHR for Social Responsibility</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.370">10.4230/LIPIcs.ICLP.2012.370</a>
</li>
<li>
<span class="authors">Nuno Lopes, Sabrina Kirrane, Antoine Zimmermann, Axel Polleres, and Alessandra Mileo</span>
<span class="title">A Logic Programming approach for Access Control over RDF</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.381">10.4230/LIPIcs.ICLP.2012.381</a>
</li>
<li>
<span class="authors">Viviana Novelli, Marina De Vos, Julian Padget, and Dina D’Ayala</span>
<span class="title">LOG-IDEAH: ASP for Architectonic Asset Preservation</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.393">10.4230/LIPIcs.ICLP.2012.393</a>
</li>
<li>
<span class="authors">Xiaoping Chen, Guoqiang Jin, and Fangkai Yang</span>
<span class="title">Extending C+ with Composite Actions for Robotic Task Planning</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.404">10.4230/LIPIcs.ICLP.2012.404</a>
</li>
<li>
<span class="authors">Massimiliano Cattafi, Rosa Herrero, Marco Gavanelli, Maddalena Nonato, and Federico Malucelli</span>
<span class="title">Improving Quality and Efficiency in Home Health Care: an application of Constraint Logic Programming for the Ferrara NHS unit</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.415">10.4230/LIPIcs.ICLP.2012.415</a>
</li>
<li>
<span class="authors">Nathaniel Wesley Filardo and Jason Eisner</span>
<span class="title">A Flexible Solver for Finite Arithmetic Circuits</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.425">10.4230/LIPIcs.ICLP.2012.425</a>
</li>
<li>
<span class="authors">Emanuele De Angelis</span>
<span class="title">Software Model Checking by Program Specialization</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.439">10.4230/LIPIcs.ICLP.2012.439</a>
</li>
<li>
<span class="authors">Martín Diéguez</span>
<span class="title">Temporal Answer Set Programming</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.445">10.4230/LIPIcs.ICLP.2012.445</a>
</li>
<li>
<span class="authors">Spyros Hadjichristodoulou</span>
<span class="title">A Gradual Polymorphic Type System with Subtyping for Prolog</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.451">10.4230/LIPIcs.ICLP.2012.451</a>
</li>
<li>
<span class="authors">Max Ostrowski</span>
<span class="title">ASP modulo CSP: The clingcon system</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.458">10.4230/LIPIcs.ICLP.2012.458</a>
</li>
<li>
<span class="authors">Andrea Peano</span>
<span class="title">An ASP Approach for the Optimal Placement of the Isolation Valves in a Water Distribution System</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.464">10.4230/LIPIcs.ICLP.2012.464</a>
</li>
<li>
<span class="authors">Christoph Redl</span>
<span class="title">Answer Set Programming with External Sources</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.469">10.4230/LIPIcs.ICLP.2012.469</a>
</li>
<li>
<span class="authors">Ben Wright</span>
<span class="title">Together, Is Anything Possible? A Look at Collective Commitments for Agents</span>
<a class="doi" href="https://doi.org/10.4230/LIPIcs.ICLP.2012.476">10.4230/LIPIcs.ICLP.2012.476</a>
</li>
</ul>
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing