Lecture Notes in Artificial Intelligence 8148
Subseries of Lecture Notes in Computer Science
LNAI Series Editors
Randy Goebel
University of Alberta, Edmonton, Canada Yuzuru Tanaka
Hokkaido University, Sapporo, Japan Wolfgang Wahlster
DFKI and Saarland University, Saarbrücken, Germany
LNAI Founding Series Editor
Joerg Siekmann
DFKI and Saarland University, Saarbrücken, Germany
Pedro Cabalar Tran Cao Son (Eds.)
Logic Programming and Nonmonotonic Reasoning
12th International Conference, LPNMR 2013 Corunna, Spain, September 15-19, 2013
Proceedings
1 3
Volume Editors Pedro Cabalar University of Corunna
Department of Computer Science Campus de Elviña s/n
15071 Corunna, Spain E-mail: [email protected] Tran Cao Son
New Mexico State University Department of Computer Science 1290 Frenger Mall, SH 123 P.O. Box 30001, MSC CS Las Cruces, NM 88003, USA E-mail: [email protected]
ISSN 0302-9743 e-ISSN 1611-3349
ISBN 978-3-642-40563-1 e-ISBN 978-3-642-40564-8 DOI 10.1007/978-3-642-40564-8
Springer Heidelberg New York Dordrecht London Library of Congress Control Number: 2013946023
CR Subject Classification (1998): I.2.3, I.2.4, F.1.1, F.4.1, D.1.6, G.2 LNCS Sublibrary: SL 7 – Artificial Intelligence
© Springer-Verlag Berlin Heidelberg 2013
This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. Exempted from this legal reservation are brief excerpts in connection with reviews or scholarly analysis or material supplied specifically for the purpose of being entered and executed on a computer system, for exclusive use by the purchaser of the work. Duplication of this publication or parts thereof is permitted only under the provisions of the Copyright Law of the Publisher’s location, in its current version, and permission for use must always be obtained from Springer. Permissions for use may be obtained through RightsLink at the Copyright Clearance Center. Violations are liable to prosecution under the respective Copyright Law.
The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use.
While the advice and information in this book are believed to be true and accurate at the date of publication, neither the authors nor the editors nor the publisher can accept any legal responsibility for any errors or omissions that may be made. The publisher makes no warranty, express or implied, with respect to the material contained herein.
Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper
Springer is part of Springer Science+Business Media (www.springer.com)
Preface
This volume contains the papers presented at the 12th International Confer- ence on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013) held during September 15–19, 2013, in Corunna.
LPNMR is a forum for exchanging ideas on declarative logic programming, nonmonotonic reasoning, and knowledge representation. The aim of the con- ference is to facilitate interaction between researchers interested in the design and implementation of logic-based programming languages and database sys- tems, and researchers who work in the areas of knowledge representation and nonmonotonic reasoning. LPNMR strives to encompass theoretical and experi- mental studies that have led or will lead to the construction of practical systems for declarative programming and knowledge representation.
LPNMR 2013 was the 12th event in the series of international conferences on Logic Programming and Nonmonotonic Reasoning. Past editions were held in Washington, D.C., USA (1991), Lisbon, Portugal (1993), Lexington, Kentucky, USA (1995), Dagstuhl, Germany (1997), El Paso, Texas, USA (1999), Vienna, Austria (2001), Fort Lauderdale, Florida, USA (2004), Diamante, Italy (2005), Tempe, Arizona, USA (2007), Potsdam, Germany (2009) and Vancouver, Canada (2011).
LPNMR 2013 received 91 submissions in three categories (technical papers, applications, and system descriptions) and two different formats (long and short papers). Each submission was reviewed by at least three Program Committee members. The final list of 53 accepted papers consists of 33 technical papers (22 long, 11 short), 12 applications (nine long, three short), and eight system descriptions (three long, five short).
The conference program featured the presentations of all accepted papers plus three invited talks by Gerhard Brewka, Robert Kowalski, and James Delgrande whose corresponding abstracts are included in these proceedings (as an extended abstract in the first two cases, and as an appendix to this preface in the third case).
The conference also hosted four workshops and the award ceremony of the Fourth ASP Competition, held and organized prior to the conference by Mario Alviano, Francesco Calimeri, Guenther Charwat, Minh Dao-Tran, Carmine Do- daro, Giovambattista Ianni, Thomas Krennwallner, Martin Kronegger, Johannes Oetsch, Andreas Pfandler, Joerg Puehrer, Christoph Redl, Francesco Ricca, Pa- trik Schneider, Martin Schwengerer, Lara Katharina Spendier, Johannes Peter Wallner, and Guohui Xiao at the University of Calabria, Italy, and the Insti- tutes of Information Systems and of Computer Language at Vienna University of Technology, Austria.
We would like to thank the members of the Program Committee and the additional reviewers for their efforts to produce fair and thorough evaluations of
VI Preface
the submitted papers, the Workshop Chair Marcello Balduccini, the local Orga- nizing Committee, especially Felicidad Aguado, Mart´ın Di´eguez, Javier Parapar, Gilberto P´erez, Concepci´on Vidal, and of course the authors of the scientific pa- pers. Furthermore we are grateful to the sponsors for their generous support: Ar- tificial Intelligence Journal, the Assocation of Logic Programming (ALP), Red IEMath-Galicia, the CITIC Research Center, the Spanish Association for Artifi- cial Intelligence (AEPIA), the European Regional Development Fund (European Commission), the University of Corunna, and New Mexico State University at Las Cruces. Last, but not least, we thank the people of EasyChair for providing resources and a marvelous conference management system.
September 2013 Pedro Cabalar
Tran Cao Son
Organization
Program Committee
Jose Julio Alferes Universidade Nova de Lisboa, Portugal
Chitta Baral Arizona State University, USA
Leopoldo Bertossi Carleton University, Canada Gerhard Brewka Leipzig University, Germany Pedro Cabalar University of Corunna, Spain Stefania Costantini Universit`a di L’Aquila, Italy
Marina De Vos University of Bath, UK
James Delgrande Simon Fraser University, Canada
Marc Denecker K.U.Leuven, Belgium
Yannis Dimopoulos University of Cyprus
Juergen Dix TU Clausthal, Germany
Agostino Dovier Universit`a di Udine, Italy
Thomas Eiter Vienna University of Technology, Austria
Esra Erdem Sabanci University, Turkey
Wolfgang Faber University of Calabria, Italy
Michael Fink Vienna University of Technology, Austria Andrea Formisano Universit`a di Perugia, Italy
Martin Gebser University of Potsdam, Germany Michael Gelfond Texas Tech University, USA Giovambattista Ianni University of Calabria, Italy Tomi Janhunen Aalto University, Finland
Antonis Kakas University of Cyprus
Joohyung Lee Arizona State University, USA
Vladimir Lifschitz University of Texas, USA
Fangzhen Lin HKUST, SAR China
Jorge Lobo Universitat Pompeu Fabra, Spain
Robert Mercer The University of Western Ontario, Canada Alessandra Mileo University of Milano-Bicocca, Italy
Mauricio Osorio UDLA, Mexico
Ramon Otero University of Corunna, USA
David Pearce Universidad Polit´ecnica de Madrid, Spain Axel Polleres Siemens AG ¨Osterreich / DERI, National
University of Ireland, Galway
VIII Organization
Enrico Pontelli New Mexico State University, USA Alessandro Provetti University of Messina, Italy
Chiaki Sakama Wakayama University, Japan
Torsten Schaub University of Potsdam, Germany John Schlipf University of Cincinnati, USA Tran Cao Son New Mexico State University, USA Terrance Swift Universidade Nova de Lisboa, Portugal Eugenia Ternovska Simon Fraser University, Canada
Hans Tompits Vienna University of Technology, Austria Mirek Truszczynski University of Kentucky, USA
Agust´ın Valverde Universidad de M´alaga, Spain
Kewen Wang Griffith University, Australia
Yisong Wang Guizhou University, China
Stefan Woltran Vienna University of Technology, Austria Jia-Huai You University of Alberta, Canada
Yan Zhang University of Western Sydney, Australia
Yi Zhou University of Western Sydney, Australia
Additional Reviewers
Acosta-Guadarrama, Juan C.
Alviano, Mario Berger, Gerald Bliem, Bernhard Bogaerts, Bart Bozzano, Marco Bulling, Nils Calimeri, Francesco Campeotto, Federico Charwat, Guenther Chen, Yin
De Cat, Broes Devriendt, Jo Ding, Ning Dvorak, Wolfgang Ensan, Alireza Falkner, Andreas Fichte, Johannes Harrison, Amelia Heljanko, Keijo Hogan, Aidan Hutter, Frank Inclezan, Daniela Inoue, Katsumi Jansen, Joachim
Ji, Jianmin Jost, Holger Kaminski, Roland Karimi, Arash Kaufmann, Benjamin Krennwallner, Thomas K¨onig, Arne
Leite, Joao Liu, Guohua Michael, Loizos Miculan, Marino Mu, Kedian
Navarro Perez, Juan Antonio Nieves, Juan Carlos
Obermeier, Philipp Oetsch, Johannes Oikarinen, Emilia Ojeda-Aciego, Manuel Perri, Simona
Pieris, Andreas Popovici, Matei P¨uhrer, J¨org Quintarelli, Elisa Redl, Christoph Ricca, Francesco
Organization IX
Romero, Javier Sabuncu, Orkunt Scalabrin, Simone Schiele, Gregor Schneider, Marius Sch¨uller, Peter Stepanova, Daria Tari, Luis
Tasharrofi, Shahab Van Hertum, Pieter Vennekens, Joost
Viegas Dam´asio, Carlos Wallner, Johannes P.
Weinzierl, Antonius Xiao, Guohui Yang, Bo Yang, Fangkai Zhang, Heng Zhang, Yingqian Zhang, Yuanlin Zhang, Zhiqiang Zhuang, Zhiqiang
X Organization
Sponsors
Managing Change in Answer Set Programs:
A Logical Approach
— Invited Talk —
James Delgrande
Simon Fraser University, Burnaby, B.C., Canada [email protected]
Abstract
Answer set programming (ASP) is an appealing, declarative approach for repre- senting problems in knowledge representation and reasoning. While answer sets have a conceptually simple syntactic characterization, ASP has been shown to be applicable to a wide range of practical problems, and efficient implementa- tions are now available. However, as is the case with any body of knowledge, a logic program is not a static object in general, but rather it will evolve and be subject to change. Such change may come about as a result of adding to (or removing from) the program, importing the contents of one program into another, merging programs, or in some other fashion modifying the knowledge in the program. In classical logic, the problem of handling such change has been thoroughly investigated. The seminal AGM approach provides a general and widely accepted framework for this purpose. While this approach focusses on revision and contraction, related work, such as merging, has stayed close to the AGM paradigm.
Until recently, the study of change in ASP has been addressed at the level of the program, focussing on the revision (and update) of logic programs. In revision, for example, a typical approach is to begin with a sequence of answer set programs, and determine answer sets based on a priority ordering among the programs or among rules in the programs. An advantage of such approaches is that they are readily implementable. On the other hand, the underlying non- monotonicity of logic programs makes it difficult to study formal properties of an approach.
Recently a more logical view of ASP has emerged. Central to this view is the (monotonic) concept of SE-models, which underlies the answer-set semantics of logic programs. In characterizing an AS program by its set of SE models, one can deal with a program at an abstract, syntax-independent level. I suggest that this is an appropriate level for dealing with change in logic programs, complement- ing earlier syntax-dependent approaches. To this end, I review such work dealing with change in logic programs, begining with the much simpler, but nonethe- less relevant, case of Horn theories. From this, I touch on work concerning AS revision, with respect to both specific approaches and logical characterisations.
XII J. Delgrande
This leads naturally to approaches for merging logic programs. While logic pro- gram contraction has not been addressed, I discuss what can be regarded as an extreme case of contraction, that of forgetting. I finish with some thoughts on open problems and issues, and future directions. The overall conclusion is that classical belief change is readily applicable to ASP, via its model theoretic basis.
Table of Contents
Towards Reactive Multi-Context Systems . . . . 1 Gerhard Brewka
Logic Programming in the 1970s . . . . 11 Robert Kowalski
Integrating Temporal Extensions of Answer Set Programming . . . . 23 Felicidad Aguado, Gilberto P´erez, and Concepci´on Vidal
Forgetting under the Well-Founded Semantics . . . . 36 Jos´e J´ulio Alferes, Matthias Knorr, and Kewen Wang
The Fourth Answer Set Programming Competition:
Preliminary Report . . . . 42 Mario Alviano, Francesco Calimeri, G¨unther Charwat,
Minh Dao-Tran, Carmine Dodaro, Giovambattista Ianni, Thomas Krennwallner, Martin Kronegger, Johannes Oetsch, Andreas Pfandler, J¨org P¨uhrer, Christoph Redl, Francesco Ricca, Patrik Schneider, Martin Schwengerer, Lara Katharina Spendier, Johannes Peter Wallner, and Guohui Xiao
WASP: A Native ASP Solver Based on Constraint Learning . . . . 54 Mario Alviano, Carmine Dodaro, Wolfgang Faber,
Nicola Leone, and Francesco Ricca
The Complexity Boundary of Answer Set Programming with
Generalized Atoms under the FLP Semantics . . . . 67 Mario Alviano and Wolfgang Faber
ARVis: Visualizing Relations between Answer Sets . . . . 73 Thomas Ambroz, G¨unther Charwat, Andreas Jusits,
Johannes Peter Wallner, and Stefan Woltran
Symbolic System Synthesis Using Answer Set Programming . . . . 79 Benjamin Andres, Martin Gebser, Torsten Schaub,
Christian Haubelt, Felix Reimann, and Michael Glaß
Accurate Computation of Sensitizable Paths Using Answer Set
Programming . . . . 92 Benjamin Andres, Matthias Sauer, Martin Gebser, Tobias Schubert,
Bernd Becker, and Torsten Schaub
XIV Table of Contents
HexSemantics via Approximation Fixpoint Theory . . . . 102 Christian Anti´c, Thomas Eiter, and Michael Fink
Encoding Higher Level Extensions of Petri Nets in Answer Set
Programming . . . . 116 Saadat Anwar, Chitta Baral, and Katsumi Inoue
Cplus2ASP: Computing Action Language C+ in Answer Set
Programming . . . . 122 Joseph Babb and Joohyung Lee
Towards Answer Set Programming with Sorts . . . . 135 Evgenii Balai, Michael Gelfond, and Yuanlin Zhang
Prolog and ASP Inference under One Roof . . . . 148 Marcello Balduccini, Yuliya Lierler, and Peter Sch¨uller
Event-Object Reasoning with Curated Knowledge Bases:
Deriving Missing Information . . . . 161 Chitta Baral and Nguyen H. Vo
Towards Query Answering in Relational Multi-Context Systems . . . . 168 Rosamaria Barilaro, Michael Fink, Francesco Ricca, and
Giorgio Terracina
Spectra in Abstract Argumentation: An Analysis of Minimal Change . . . 174 Ringo Baumann and Gerhard Brewka
Normalizing Cardinality Rules Using Merging and Sorting
Constructions . . . . 187 Jori Bomanson and Tomi Janhunen
Experience Based Nonmonotonic Reasoning . . . . 200 Daniel Borchmann
An ASP Application in Integrative Biology: Identification of Functional
Gene Units . . . . 206 Philippe Bordron, Damien Eveillard, Alejandro Maass,
Anne Siegel, and Sven Thiele
Evaluating Answer Set Clause Learning for General Game Playing . . . . . 219 Timothy Cerexhe, Orkunt Sabuncu, and Michael Thielscher
VCWC: A Versioning Competition Workflow Compiler . . . . 233 G¨unther Charwat, Giovambattista Ianni, Thomas Krennwallner,
Martin Kronegger, Andreas Pfandler, Christoph Redl, Martin Schwengerer, Lara Katharina Spendier, Johannes Peter Wallner, and Guohui Xiao
Table of Contents XV
A Sequential Model for Reasoning about Bargaining in Logic
Programs . . . . 239 Wu Chen, Dongmo Zhang, and Maonian Wu
Extending the Metabolic Network of Ectocarpus Siliculosus Using
Answer Set Programming . . . . 245 Guillaume Collet, Damien Eveillard, Martin Gebser,
Sylvain Prigent, Torsten Schaub, Anne Siegel, and Sven Thiele
Negation as a Resource: A Novel View on Answer Set Semantics . . . . 257 Stefania Costantini and Andrea Formisano
AGM-Style Belief Revision of Logic Programs under Answer Set
Semantics . . . . 264 James Delgrande, Pavlos Peppas, and Stefan Woltran
Efficient Approximation of Well-Founded Justification and
Well-Founded Domination . . . . 277 Christian Drescher and Toby Walsh
Approximate Epistemic Planning with Postdiction as Answer-Set
Programming . . . . 290 Manfred Eppe, Mehul Bhatt, and Frank Dylla
Combining Equilibrium Logic and Dynamic Logic . . . . 304 Luis Fari˜nas del Cerro, Andreas Herzig, and Ezgi Iraz Su
ActHEX: Implementing HEX Programs with Action Atoms . . . . 317 Michael Fink, Stefano Germano, Giovambattista Ianni,
Christoph Redl, and Peter Sch¨uller
Debugging Answer-Set Programs with Ouroboros – Extending the
SeaLion Plugin . . . . 323 Melanie Fr¨uhst¨uck, J¨org P¨uhrer, and Gerhard Friedrich
Game Semantics for Non-monotonic Intensional Logic Programming . . . . 329 Chrysida Galanaki, Christos Nomikos, and Panos Rondogiannis
Matchmaking with Answer Set Programming . . . . 342 Martin Gebser, Thomas Glase, Orkunt Sabuncu, and Torsten Schaub
Ricochet Robots: A Transverse ASP Benchmark . . . . 348 Martin Gebser, Holger Jost, Roland Kaminski, Philipp Obermeier,
Orkunt Sabuncu, Torsten Schaub, and Marius Schneider
Decidability and Implementation of Parametrized Logic Programs . . . . 361 Ricardo Gon¸calves and Jos´e J´ulio Alferes
XVI Table of Contents
Non-monotonic Temporal Goals . . . . 374 Ricardo Gon¸calves, Matthias Knorr, Jo˜ao Leite, and Martin Slota
On Equivalent Transformations of Infinitary Formulas under the Stable
Model Semantics (Preliminary Report) . . . . 387 Amelia Harrison, Vladimir Lifschitz, and Miroslaw Truszczynski
An Application of ASP to the Field of Second Language Acquisition . . . . 395 Daniela Inclezan
Turner’s Logic of Universal Causation, Propositional Logic, and Logic
Programming . . . . 401 Jianmin Ji and Fangzhen Lin
Concrete Results on Abstract Rules . . . . 414 Markus Kr¨otzsch, Despoina Magka, and Ian Horrocks
Linear Logic Programming for Narrative Generation . . . . 427 Chris Martens, Anne-Gwenn Bosser, Jo˜ao F. Ferreira, and
Marc Cavazza
Implementing Informal Semantics of ASP . . . . 433 Artur Mikitiuk and Miroslaw Truszczynski
Implementing Belief Change in the Situation Calculus and an
Application . . . . 439 Maurice Pagnucco, David Rajaratnam, Hannes Strass, and
Michael Thielscher
Debugging Non-ground ASP Programs with Choice Rules, Cardinality
and Weight Constraints . . . . 452 Axel Polleres, Melanie Fr¨uhst¨uck, Gottfried Schenner, and
Gerhard Friedrich
Conflict-Based Program Rewriting for Solving Configuration
Problems . . . . 465 Anna Ryabokon, Gerhard Friedrich, and Andreas A. Falkner
Program Updating by Incremental and Answer Subsumption Tabling . . . 479 Ari Saptawijaya and Lu´ıs Moniz Pereira
Characterization Theorems for Revision of Logic Programs . . . . 485 Nicolas Schwind and Katsumi Inoue
Flexible Combinatory Categorial Grammar Parsing Using the CYK
Algorithm and Answer Set Programming . . . . 499 Peter Sch¨uller
Early Recovery in Logic Program Updates . . . . 512 Martin Slota, Martin Bal´aˇz, and Jo˜ao Leite
Table of Contents XVII
Preference Handling for Belief-Based Rational Decisions . . . . 518 Samy S´a and Jo˜ao Alcˆantara
Logic-Based Techniques for Data Cleaning: An Application to the
Italian National Healthcare System . . . . 524 Giorgio Terracina, Alessandra Martello, and Nicola Leone
Justifications for Logic Programming . . . . 530 Carlos Viegas Dam´asio, Anastasia Analyti, and Grigoris Antoniou
Belief Change in Nonmonotonic Multi-Context Systems . . . . 543 Yisong Wang, Zhiqiang Zhuang, and Kewen Wang
On Optimal Solutions of Answer Set Optimization Problems . . . . 556 Ying Zhu and Miroslaw Truszczynski
Author Index . . . . 569
