Logic Programming and Nonmonotonic Reasoning: 8th International Conference, LPNMR 2005, Diamante, Italy, September 5-8, 2005, Proceedings (Lecture Notes in Computer Science, 3662). Questo articolo non è disponibile.Logic Programming and Nonmonotonic Reasoning: 8th International Conference, LPNMR 2005, Diamante, Italy, September 5-8, 2005, Proceedings (Lecture Notes in Computer Science, 3662)

Thesearetheproceedingsofthe8thInternational Conference on Logic Progr- mingandNonmonotonicReasoning (LPNMR2005).Followingthepreviousones held in Washington, DC, USA (1991), Lisbon, Portugal (1993), Lexington, KY, USA(1995),Dagstuhl,Germany(1997),ElPaso,TX,USA(1999),Vienna,A- tria (2001) and Ft. Lauderdale, FL, USA (2004), the eighth conference was held in Diamante, Italy, from 5th to 8th of September 2005. TheaimoftheLPNMRconferencesistobringtogetherandfacilitateinter- tions between active researchers interested in all aspects concerning declarative logic programming,nonmonotonic reasoning,knowledge representation, and the design of logic-based systems and database systems. LPNMR strives to enc- pass theoretical and experimental studies that lead to the implementation of practical systems for declarative programming and knowledge representation. The technical program of LPNMR 2005 comprised three invited talks that were given by Jur ¨ gen Angele, Thomas Eiter and Michael Kifer. All papers p- sented at the conference and published in these proceedings went through a rigorous review process which selected 25 research papers and 16 papers for the system and application tracks. Many individuals worked for the success of the conference. Special thanks are due to all members of the Program Committee and to additional reviewers for their e?orts to produce fair and thorough evaluations of submitted papers. A special thanks is due to the University of Calabria Organizing Committee which made this event possible. Last, but not least, we thank the sponsoring institutions for their generosity. June 2005 Chitta Baral and Nicola Leone Program Co-chairs LPNMR’05 Organization LPNMR 2005 was organized by the Department of Mathematics at the Univ- sity of Calabria, Italy.

Invited Papers.- Nonmonotonic Reasoning in FLORA-2.- Data Integration and Answer Set Programming.- Halo I: A Controlled Experiment for Large Scale Knowledge Base Development.- ASP Foundations.- Unfounded Sets for Disjunctive Logic Programs with Arbitrary Aggregates.- Loops: Relevant or Redundant?.- Approximating Answer Sets of Unitary Lifschitz-Woo Programs.- On Modular Translations and Strong Equivalence.- ASP Extensions.- Guarded Open Answer Set Programming.- External Sources of Computation for Answer Set Solvers.- Answer Sets for Propositional Theories.- Applications.- An ID-Logic Formalization of the Composition of Autonomous Databases.- On the Local Closed-World Assumption of Data-Sources.- Computing Dialectical Trees Efficiently in Possibilistic Defeasible Logic Programming.- Actions and Causations.- An Approximation of Action Theories of and Its Application to Conformant Planning.- Game-Theoretic Reasoning About Actions in Nonmonotonic Causal Theories.- Some Logical Properties of Nonmonotonic Causal Theories.- odular-?: An Elaboration Tolerant Approach to the Ramification and Qualification Problems.- Algorithms and Computation.- Platypus: A Platform for Distributed Answer Set Solving.- Solving Hard ASP Programs Efficiently.- Mode-Directed Fixed Point Computation.- Lookahead in Smodels Compared to Local Consistencies in CSP.- Foundations.- Nested Epistemic Logic Programs.- An Algebraic Account of Modularity in ID-Logic.- Default Reasoning with Preference Within Only Knowing Logic.- Semantics.- A Social Semantics for Multi-agent Systems.- Revisiting the Semantics of Interval Probabilistic Logic Programs.- Routley Semantics for Answer Sets.- The Well Supported Semantics for Multidimensional Dynamic Logic Programs.- Application Track.- Application of Smodels in Quartet Based Phylogeny Construction.- Using Answer Set Programming for a Decision Support System.- Data Integration: a Challenging ASP Application.- Abduction and Preferences in Linguistics.- Inference of Gene Relations from Microarray Data by Abduction.- System Track.- nomore: A System for Computing Preferred Answer Sets.- Integrating an Answer Set Solver into Prolog: - .- circ2dlp — Translating Circumscription into Disjunctive Logic Programming.- Pbmodels — Software to Compute Stable Models by Pseudoboolean Solvers.- KMonitor– A Tool for Monitoring Plan Execution in Action Theories.- The nomore++ System.- Smodels A — A System for Computing Answer Sets of Logic Programs with Aggregates.- A DLP System with Object-Oriented Features.- Testing Strong Equivalence of Datalog Programs – Implementation and Examples.- SELP – A System for Studying Strong Equivalence Between Logic Programs.- cmodels – SAT-Based Disjunctive Answer Set Solver.