%0
Generic
%T
Logic Programming and Nonmonotonic Reasoning
9th International Conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007. Proceedings
%A Baral, Chitta
%A Brewka, Gerhard
%A Schlipf, John
%I Springer-Verlag Berlin Heidelberg
%@ 9783540722007
%K Computer science
%K Computer Science
%K Artificial intelligence
%K Software engineering.
%K Machine theory.
%K Computer programming.
%K Konferenzschrift 2007 Tempe, Ariz.
%K Logische Programmierung
%K Wissensrepräsentation
%K Nichtmonotones Schließen
%K Problemlösen
%K Inferenz Künstliche Intelligenz
%K Computational logic
%D 2007
%X International conference proceedings
%X Includes bibliographical references and author index
%X ""Title page""; ""Preface""; ""Conference Organization""; ""Table of Contents""; ""Logic Programming and Nonmonotonic Reasoning: From Theory to Systems and Applications""; ""Policy-Based Computing: From Systems and Applications to Theory""; ""The First Answer Set Programming System Competition""; ""Introduction""; ""Format""; ""Platform""; ""Benchmarks""; ""Competitors""; ""Results""; ""Results of the MGS Competition""; ""Results of the SCore Competition""; ""Results of the SLparse Competition""; ""Discussion""; ""CR-MODELS: An Inference Engine for CR-Prolog""; ""Introduction""; ""CR-Prolog""
%X ""The CRMODELS Algorithm""""Related Work and Conclusions""; ""Debugging ASP Programs by Means of ASP""; ""Introduction""; ""Background""; ""Debugging Modules""; ""Kernel Debugging Module""; ""Extrapolating Non-existing Answer Sets""; ""Ordering Rule Applications""; ""Debugging Programs with Variables""; ""Implementation""; ""Elements of a Debugging Language""; ""Discussion and Related Work""; ""A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation""; ""Introduction""; ""The Infinite-Valued Semantics""; ""Kripke Semantics""; ""Existence of Minimal Models""
%X ""Properties of the Minimal Model Semantics""""Identifying the Minimal Models""; ""Related Approaches""; ""Conclusions""; ""Complexity of Default Logic on Generalized Conjunctive Queries""; ""Introduction""; ""Preliminaries""; ""Closure Properties of Constraints""; ""Default Logic""; ""Complexity Results""; ""Concluding Remarks""; ""A Preference-Based Framework for Updating Logic Programs""; ""Introduction""; ""Background""; ""The Basic Framework""; ""Update Programs""; ""Properties of Updates""; ""Examples and Properties vis-Ã -vis bold0mu mumu Rawbold0mu mumu eeRaweeee""; ""Discussion""
%X ""Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions""""Introduction""; ""Approximation Theory""; ""Monotone and Well-Founded Inductions""; ""Well-Founded Semantics of ID-Logic Definitions""; ""Conclusion""; ""On the Complexity of Answer Set Programming with Aggregates""; ""Introduction""; ""The DLP^A Language""; ""Syntax""; ""Semantics""; ""Overview of Complexity Results""; ""Proofs of Hardness Results""; ""Proofs of Membership Results""; ""Conclusions""; ""Experimenting with Look-Back Heuristics for Hard ASP Programs""; ""Introduction""
%X ""Answer Set Programming Language""""Answer Set Computation""; ""Reasons for Literals""; ""Heuristics""; ""Experiments""; ""Compared Methods""; ""Benchmark Programs and Data""; ""Results""; ""Conclusions""; ""Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains""; ""Introduction""; ""Preliminaries""; ""Tautological Rules""; ""Complexity of Detecting Tautological Rules in a Finite Domain""; ""Tractable Cases""; ""Rule Subsumption""; ""Complexity of Rule Subsumption""; ""Restricting Variable Occurrences and Tractability""; ""Discussion and Conclusion""
%X ""Conflict-Driven Answer Set Enumeration""
%C Springer-Verlag Berlin Heidelberg
%C Berlin, Heidelberg
%U http://slubdd.de/katalog?TN_libero_mab2