Accepted Papers

Complete list of LPNMR-07 accepted technical papers and system descriptions

Technical Papers:

  • Philippe Chapdelaine, Miki Hermann and Ilka Schnoor. Complexity of Default Logic on Generalized Conjunctive Queries
  • James Delgrande, Torsten Schaub and Hans Tompits. A Preference-Based Framework for Updating Logic Programs
  • Martin Gebser, Benjamin Kaufmann, Andre Neumann and Torsten Schaub. Conflict-Driven Answer Set Enumeration
  • Martin Brain, Martin Gebser, Joerg Puehrer, Torsten Schaub, Hans Tompits and Stefan Woltran. Debugging ASP programs within ASP
  • Marc Denecker and Joost Vennekens. Well-founded semantics and the algebraic theory of non-monotone inductive definitions
  • Vladimir Lifschitz, David Pearce and Agustín Valverde. A Characterization of Strong Equivalence for Logic Programs with Variables
  • Marc Meister, Khalil Djelloul and Jacques Robin. A Unified Semantics for Constraint Handling Rules in Transaction Logic
  • Ping Hou, Johan Wittocx and Marc Denecker. A Deductive System for PC(ID)
  • Tomi Janhunen, Emilia Oikarinen, Hans Tompits and Stefan Woltran. Modularity Aspects of Disjunctive Stable Models
  • Jia-Huai You, Li-Yan Yuan, Guohua Liu and Yi-Dong Shen. Logic programs with abstract constraints: representation, disjunction, and complexities
  • Martin Gebser, Joohyung Lee and Yuliya Lierler. Head-Elementary-Set-Free Logic Programs
  • Yi Zhou, Fangzhen Lin and Yan Zhang. General Default Logic $\mathcal{R}$
  • Pedro Cabalar, David Pearce, Panos Rondogiannis and William Wadge. A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation
  • Michael Fink, Reinhard Pichler, Hans Tompits and Stefan Woltran. Complexity of Rule Redundancy in Non-Ground Answer-Set Programming over Finite Domains
  • Wolfgang Faber, Nicola Leone, Marco Maratea and Francesco Ricca. Experimenting with Look-Back Heuristics on Hard ASP Programs
  • Marcello Balduccini. CR-Models: An Inference Engine for CR-Prolog
  • Davy Van Nieuwenborgh, Thomas Eiter and Dirk Vermeir. Conditional Planning with External Functions
  • Wolfgang Faber and Nicola Leone. On the Complexity of Answer Set Programming with Aggregates


  • Edgardo Ferretti, Marcelo Errecalde, Alejandro Garcia, Guillermo Simari. An Application of Defeasible Logic Programming to Decision Making in a Robotic Environment
  • Guohua Liu, Jia-Huai You. On the Effectiveness of Looking Ahead in Search for Answer Sets
  • Veena Mellarkod, Michael Gelfond. Enhancing ASP Systems for Planning with Temporal Constraints
  • Juan-Carlos Nieves, Mauricio Osorio, Ulises Cortes. Semantics for Possibilistic Disjunctive Programs
  • Emilia Oikarinen. Modularity in smodels Programs

System Descriptions:

  • Martin Gebser, Benjamin Kaufmann, Andre Neumann and Torsten Schaub. clasp: A Conflict-Driven Answer Set Solver
  • Martin Gebser, Torsten Schaub and Sven Thiele. GrinGo: A New Grounder for Answer Set Programming
  • Aaron Hunter, James Delgrande and Joel Faber. Using Answer Sets to Solve Belief Change Problems
  • Fabrizio Angiulli, Gianluigi Greco, Luigi Palopoli and Domenico Trimboli. The LPOD System: Logic Programming meets Outlier Detection
  • Giacomo Terreni, Paolo Mancarella, Francesca Toni and Fariba Sadri. Programming Applications in CIFF
  • Phan Huy Tu, Tran Cao Son and Enrico Pontelli. CPP: A Constraint Logic Programming Based Planner with Preferences
  • Gayathri Namasivayam and Miroslaw Truszczynski. Smodels System with Limited Lookahead Computation