Logic Programming and Nonmonotonic Reasoning: 7th International Conference, LPNMR 2004, Fort Lauderdale, FL, USA, January 6-8, 2004, Proceedings (Lecture Notes in Computer Science)

This book constitutes the refereed proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2004, held in Fort Lauderdale, Florida, USA in January 2004. The 24 revised full papers presented together with 8 system descriptions were carefully reviewed and selected for presentation. Among the topics addressed are declarative logic programming, nonmonotonic reasoning, knowledge representation, combinatorial search, answer set programming, constraint programming, deduction in ontologies, and planning. Front Matter....Pages - Constraints and Probabilistic Networks: A Look At The Interface....Pages 1-1 Toward A Universal Inference Engine....Pages 2-2 Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative....Pages 3-7 Semantics for Dynamic Logic Programming: A Principle-Based Approach....Pages 8-20 Probabilistic Reasoning With Answer Sets....Pages 21-33 Answer Sets: From Constraint Programming Towards Qualitative Optimization....Pages 34-46 A Logic of Non-monotone Inductive Definitions and Its Modularity Properties....Pages 47-60 Reasoning About Actions and Change in Answer Set Programming....Pages 61-73 Almost Definite Causal Theories....Pages 74-86 Simplifying Logic Programs Under Uniform and Strong Equivalence....Pages 87-99 Towards Automated Integration of Guess and Check Programs in Answer Set Programming....Pages 100-113 Towards Automated Integration of Guess and Check Programs in Answer Set Programming....Pages 114-126 Graphs and Colorings for Answer Set Programming: Abridged Report....Pages 127-140 Nondefinite vs. Definite Causal Theories ....Pages 141-153 Logic Programs With Monotone Cardinality Atoms....Pages 154-166 Set Constraints in Logic Programming....Pages 167-179 Verifying the Equivalence of Logic Programs in the Disjunctive Case....Pages 180-193 Uniform Equivalence for Equilibrium Logic and Logic Programs....Pages 194-206 Partial Stable Models for Logic Programs with Aggregates....Pages 207-219 Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs....Pages 220-233 Using Criticalities as a Heuristic for Answer Set Programming....Pages 234-246 Planning with Preferences Using Logic Programming....Pages 247-260 Planning with Sensing Actions and Incomplete Information Using Logic Programming....Pages 261-274 Deduction in Ontologies via ASP....Pages 275-288 Strong Equivalence for Causal Theories....Pages 289-301 Answer Set Programming with Clause Learning....Pages 302-313 Properties of Iterated Multiple Belief Revision....Pages 314-325 System Description: DLV with Aggregates....Pages 326-330 GNT — A Solver for Disjunctive Logic Programs....Pages 331-335 LPEQ and DLPEQ — Translators for Automated Equivalence Testing of Logic Programs....Pages 336-340 DLV DB : Bridging the Gap between ASP Systems and DBMSs....Pages 341-345 Cmodels-2: SAT-based Answer Set Solver Enhanced to Non-tight Programs....Pages 346-350 WSAT( CC ) — A Fast Local-Search ASP Solver....Pages 351-355 Smodels with CLP—A Treatment of Aggregates in ASP....Pages 356-360 nlp: A Compiler for Nested Logic Programming....Pages 361-364 Back Matter....Pages - Logic Programming and Nonmonotonic Reasoning: 7th International Conference, LPNMR 2004 Fort Lauderdale, FL, USA, January 6-8, 2004 Proceedings Author: Vladimir Lifschitz, Ilkka Niemelä Published by Springer Berlin Heidelberg ISBN: 978-3-540-20721-4 DOI: 10.1007/b94792 Table of Contents: Constraints and Probabilistic Networks: A Look At The Interface Toward A Universal Inference Engine Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative Semantics for Dynamic Logic Programming: A Principle-Based Approach Probabilistic Reasoning With Answer Sets Answer Sets: From Constraint Programming Towards Qualitative Optimization A Logic of Non-monotone Inductive Definitions and Its Modularity Properties Reasoning About Actions and Change in Answer Set Programming Almost Definite Causal Theories Simplifying Logic Programs Under Uniform and Strong Equivalence Towards Automated Integration of Guess and Check Programs in Answer Set Programming Towards Automated Integration of Guess and Check Programs in Answer Set Programming Graphs and Colorings for Answer Set Programming: Abridged Report Nondefinite vs. Definite Causal Theories Logic Programs With Monotone Cardinality Atoms Set Constraints in Logic Programming Verifying the Equivalence of Logic Programs in the Disjunctive Case Uniform Equivalence for Equilibrium Logic and Logic Programs Partial Stable Models for Logic Programs with Aggregates Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs

This book constitutes the refereed proceedings of the 7th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2004, held in Fort Lauderdale, Florida, USA in January 2004.

The 24 revised full papers presented together with 8 system descriptions were carefully reviewed and selected for presentation. Among the topics addressed are declarative logic programming, nonmonotonic reasoning, knowledge representation, combinatorial search, answer set programming, constraint programming, deduction in ontologies, and planning.

Answer-set programming (ASP) emerged in the late 90s as a new logic programming paradigm [3,4,5], having its roots in nonmonotonic reasoning, deductive databases and logic programming with negation as failure.