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

by Baral, Chitta; Brewka, Gerhard; Schlipf, John

• ISBN13: 9783540721994
• ISBN10: 3540721991
• Format: Paperback
• Copyright: 2007-06-01
• Publisher: Springer Verlag

Summary

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, 5 revised poster papers, and 7 system descriptions presented together with 2 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. Also contained in this volume are the results of this year's answer set programming competition.

Table of Contents

Logic programming and nonmonotonic reasoning : from theory to systems and applications	p. 1
Policy-based computing : from systems and applications to theory	p. 2
The first answer set programming system competition	p. 3
CR-models : an inference engine for CR-prolog	p. 18
Debugging ASP programs by means of ASP	p. 31
A purely model-theoretic semantics for disjunctive logic programs with negation	p. 44
Complexity of default logic on generalized conjunctive queries	p. 58
A preference-based framework for updating logic programs	p. 71
Well-founded semantics and the algebraic theory of non-monotone inductive definitions	p. 84
On the complexity of answer set programming with aggregates	p. 97
Experimenting with look-back heuristics for hard ASP programs	p. 110
Complexity of rule redundancy in non-ground answer-set programming over finite domains	p. 123
Conflict-driven answer set enumeration	p. 136
Head-elementary-set-free logic programs	p. 149
A deductive system for PC(ID)	p. 162
Modularity aspects of disjunctive stable models	p. 175
A characterization of strong equivalence for logic programs with variables	p. 188
A unified semantics for constraint handling rules in transaction logic	p. 201
Conditional planning with external functions	p. 214
Logic programs with abstract constraints : representaton, disjunction and complexities	p. 228
General default logic	p. 241
The LP-OD system : logic programming meets outlier detection	p. 254
Clasp : a conflict-driven answer set solver	p. 260
GrinGo : a new grounder for answer set programming	p. 266
Using answer sets to solve belief change problems	p. 272
An Smodels system with limited lookahead computation	p. 278
Programming applications in CIFF	p. 284
CPP : a constraint logic programming based planner with preferences	p. 290
An application of defeasible logic programming to decision making in a robotic environment	p. 297
On the effectiveness of looking ahead in search for answer sets	p. 303
Enhancing ASP systems for planning with temporal constraints	p. 309
Semantics for possibilistic disjunctive programs	p. 315
Modularity in smodels programs	p. 321
Table of Contents provided by Blackwell. All Rights Reserved.