Logic Programming and Nonmonotonic Reasoning
Subtitle: 7th International Conference, LPNMR 2004, Fort Lauderdale, FL, USA, January 6-8, 2004, Proceedings (Lecture Notes in Computer Science)
Contributors: Vladimir Lifschitz (Editor); Ilkka Niemelä (Editor)
Edition: 1 edition
Publisher: Springer
Published: February 12, 2004
Language: eng
Format: Paperback
Number of pages: 365
ISBN-13: 9783540207214
Subjects: Computer Programming; General; Computers; Computers - General Information; Programming - Object Oriented Programming; Computer Books: General; Nonmonotonic reasoning; Logic; Artificial Intelligence - General; Computers / Artificial Intelligence; Congresses; Logic programming; Logisch programmeren.; gtt
First sentence: 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.
Description: Logic Programming and Nonmonotonic Reasoning: 7th International Conference, LPNMR 2004 Fort Lauderdale, FL, USA, January 6-8, 2004 Proceedings<br />Author: Vladimir Lifschitz, Ilkka Niemelä<br /> Published by Springer Berlin Heidelberg<br /> ISBN: 978-3-540-20721-4<br /> DOI: 10.1007/b94792<br /><br />Table of Contents:<p></p><ul><li>Constraints and Probabilistic Networks: A Look At The Interface
</li><li>Toward A Universal Inference Engine
</li><li>Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative
</li><li>Semantics for Dynamic Logic Programming: A Principle-Based Approach
</li><li>Probabilistic Reasoning With Answer Sets
</li><li>Answer Sets: From Constraint Programming Towards Qualitative Optimization
</li><li>A Logic of Non-monotone Inductive Definitions and Its Modularity Properties
</li><li>Reasoning About Actions and Change in Answer Set Programming
</li><li>Almost Definite Causal Theories
</li><li>Simplifying Logic Programs Under Uniform and Strong Equivalence
</li><li>Towards Automated Integration of Guess and Check Programs in Answer Set Programming
</li><li>Towards Automated Integration of Guess and Check Programs in Answer Set Programming
</li><li>Graphs and Colorings for Answer Set Programming: Abridged Report
</li><li>Nondefinite vs. Definite Causal Theories
</li><li>Logic Programs With Monotone Cardinality Atoms
</li><li>Set Constraints in Logic Programming
</li><li>Verifying the Equivalence of Logic Programs in the Disjunctive Case
</li><li>Uniform Equivalence for Equilibrium Logic and Logic Programs
</li><li>Partial Stable Models for Logic Programs with Aggregates
</li><li>Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs</li></ul>