Logic Programming and Nonmonotonic Reasoning: 9th International Conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007. Proceedings

Nicola Leone (auth.), Chitta Baral, Gerhard Brewka, John Schlipf (eds.)3540722009, 3540721991, 9783540722007, 9783540721994

This book constitutes the refereed proceedings of the 9th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2007, held in Tempe, AZ, USA in May 2007.

The 18 revised full papers, five revised poster papers, and seven system descriptions presented together with two invited papers were carefully reviewed and selected for presentation. As a forum for exchanging ideas on declarative logic programming, nonmonotonic reasoning, and knowledge representation, LPNMR encompasses theoretical studies, design and implementation of logic based programming languages and database systems, and development of experimental systems. This volume also includes the results of this year’s answer set programming competition.

---

Table of contents :
Front Matter….Pages –
Logic Programming and Nonmonotonic Reasoning: From Theory to Systems and Applications….Pages 1-1
Policy-Based Computing: From Systems and Applications to Theory….Pages 2-2
The First Answer Set Programming System Competition….Pages 3-17
cr-models : An Inference Engine for CR-Prolog….Pages 18-30
Debugging ASP Programs by Means of ASP….Pages 31-43
A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation….Pages 44-57
Complexity of Default Logic on Generalized Conjunctive Queries….Pages 58-70
A Preference-Based Framework for Updating Logic Programs….Pages 71-83
Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions….Pages 84-96
On the Complexity of Answer Set Programming with Aggregates….Pages 97-109
Experimenting with Look-Back Heuristics for Hard ASP Programs….Pages 110-122
Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains….Pages 123-135
Conflict-Driven Answer Set Enumeration….Pages 136-148
Head-Elementary-Set-Free Logic Programs….Pages 149-161
A Deductive System for PC(ID)….Pages 162-174
Modularity Aspects of Disjunctive Stable Models….Pages 175-187
A Characterization of Strong Equivalence for Logic Programs with Variables….Pages 188-200
A Unified Semantics for Constraint Handling Rules in Transaction Logic….Pages 201-213
Conditional Planning with External Functions….Pages 214-227
Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities….Pages 228-240
General Default Logic….Pages 241-253
The $mathcal{LPmbox{-,}OD}$ System: Logic Programming Meets Outlier Detection….Pages 254-259
clasp : A Conflict-Driven Answer Set Solver….Pages 260-265
GrinGo : A New Grounder for Answer Set Programming….Pages 266-271
Using Answer Sets to Solve Belief Change Problems….Pages 272-277
An Smodels System with Limited Lookahead Computation….Pages 278-283
Programming Applications in CIFF….Pages 284-289
CPP: A Constraint Logic Programming Based Planner with Preferences….Pages 290-296
An Application of Defeasible Logic Programming to Decision Making in a Robotic Environment….Pages 297-302
On the Effectiveness of Looking Ahead in Search for Answer Sets….Pages 303-308
Enhancing ASP Systems for Planning with Temporal Constraints….Pages 309-314
Semantics for Possibilistic Disjunctive Programs….Pages 315-320
Modularity in smodels Programs….Pages 321-326
Back Matter….Pages –