This book constitutes the refereed proceedings of the 8th International Conference on Logic Programming and Nonmonotonic Reasoning, LPNMR 2005, held in Diamante, Italy in September 2005.
The 25 revised full papers, 16 revised for the system and application tracks presented together with 3 invited papers were carefully reviewed and selected for presentation. Among the topics addressed are semantics of new and existing languages; relationships between formalisms; complexity and expressive power; LPNMR systems: development of inference algorithms and search heuristics, updates and other operations, uncertainty, and applications in planning, diagnosis, system descriptions, comparisons and evaluations; software engineering, decision making, and other domains; LPNMR languages: extensions by new logical connectives and new inference capabilities, applications in data integration and exchange systems, and methodology of representing knowledge.
Author(s): Michael Kifer (auth.), Chitta Baral, Gianluigi Greco, Nicola Leone, Giorgio Terracina (eds.)
Series: Lecture Notes in Computer Science 3662 : Lecture Notes in Artificial Intelligence
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2005
Language: English
Pages: 462
Tags: Artificial Intelligence (incl. Robotics); Mathematical Logic and Formal Languages; Programming Techniques
Front Matter....Pages -
Nonmonotonic Reasoning in FLORA-2....Pages 1-12
Data Integration and Answer Set Programming....Pages 13-25
Halo I: A Controlled Experiment for Large Scale Knowledge Base Development....Pages 26-39
Unfounded Sets for Disjunctive Logic Programs with Arbitrary Aggregates....Pages 40-52
Loops: Relevant or Redundant?....Pages 53-65
Approximating Answer Sets of Unitary Lifschitz-Woo Programs....Pages 66-78
On Modular Translations and Strong Equivalence....Pages 79-91
Guarded Open Answer Set Programming....Pages 92-104
External Sources of Computation for Answer Set Solvers....Pages 105-118
Answer Sets for Propositional Theories....Pages 119-131
An ID-Logic Formalization of the Composition of Autonomous Databases....Pages 132-144
On the Local Closed-World Assumption of Data-Sources....Pages 145-157
Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming....Pages 158-171
An Approximation of Action Theories of $\mathcal{AL}$ and Its Application to Conformant Planning....Pages 172-184
Game-Theoretic Reasoning About Actions in Nonmonotonic Causal Theories....Pages 185-197
Some Logical Properties of Nonmonotonic Causal Theories....Pages 198-210
$\mathcal{M}$ odular- ε : An Elaboration Tolerant Approach to the Ramification and Qualification Problems....Pages 211-226
Platypus : A Platform for Distributed Answer Set Solving....Pages 227-239
Solving Hard ASP Programs Efficiently....Pages 240-252
Mode-Directed Fixed Point Computation....Pages 253-265
Lookahead in Smodels Compared to Local Consistencies in CSP....Pages 266-278
Nested Epistemic Logic Programs....Pages 279-290
An Algebraic Account of Modularity in ID-Logic....Pages 291-303
Default Reasoning with Preference Within Only Knowing Logic....Pages 304-316
A Social Semantics for Multi-agent Systems....Pages 317-329
Revisiting the Semantics of Interval Probabilistic Logic Programs....Pages 330-342
Routley Semantics for Answer Sets....Pages 343-355
The Well Supported Semantics for Multidimensional Dynamic Logic Programs....Pages 356-368
Application of Smodels in Quartet Based Phylogeny Construction....Pages 369-373
Using Answer Set Programming for a Decision Support System....Pages 374-378
Data Integration: a Challenging ASP Application....Pages 379-383
Abduction and Preferences in Linguistics....Pages 384-388
Inference of Gene Relations from Microarray Data by Abduction....Pages 389-393
nomore < : A System for Computing Preferred Answer Sets....Pages 394-398
Integrating an Answer Set Solver into Prolog: $\mathbb{ASP}$ - $\mathbb{PROLOG}$ ....Pages 399-404
circ2dlp — Translating Circumscription into Disjunctive Logic Programming....Pages 405-409
Pbmodels — Software to Compute Stable Models by Pseudoboolean Solvers....Pages 410-415
K Monitor – A Tool for Monitoring Plan Execution in Action Theories....Pages 416-421
The nomore ++ System....Pages 422-426
Smodels A — A System for Computing Answer Sets of Logic Programs with Aggregates....Pages 427-431
A DLP System with Object-Oriented Features....Pages 432-436
Testing Strong Equivalence of Datalog Programs – Implementation and Examples....Pages 437-441
SELP – A System for Studying Strong Equivalence Between Logic Programs....Pages 442-446
cmodels – SAT-Based Disjunctive Answer Set Solver....Pages 447-451
Back Matter....Pages -
