• Media type: E-Book; Conference Proceedings
  • Title: Logic Programming and Nonmonotonic Reasoning : 9th International Conference, LPNMR 2007, Tempe, AZ, USA, May 15-17, 2007. Proceedings
  • Contains: ""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""
    ""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""
    ""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""
    ""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""
    ""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""
    ""Conflict-Driven Answer Set Enumeration""
  • Contributor: Baral, Chitta [Other]; Brewka, Gerhard [Other]; Schlipf, John [Other]
  • imprint: Berlin, Heidelberg: Springer-Verlag Berlin Heidelberg, 2007
  • Published in: Lecture notes in computer science ; 4483
    Bücher
  • Extent: Online-Ressource (IX, 327 p. Also available online, digital)
  • Language: English
  • DOI: 10.1007/978-3-540-72200-7
  • ISBN: 9783540722007
  • Identifier:
  • RVK notation: SS 4800 : Lecture notes in computer science
  • Keywords: Logische Programmierung
    Wissensrepräsentation > Nichtmonotones Schließen
    Problemlösen > Inferenz > Computational logic
    Logische Programmierung
    Wissensrepräsentation > Nichtmonotones Schließen
    Problemlösen > Inferenz > Computational logic
  • Origination:
  • Footnote: International conference proceedings
    Includes bibliographical references and author index
  • Description: Invited Talks/Competition -- 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 -- Technical Papers -- cr-models: An Inference Engine for CR-Prolog -- Debugging ASP Programs by Means of ASP -- A Purely Model-Theoretic Semantics for Disjunctive Logic Programs with Negation -- Complexity of Default Logic on Generalized Conjunctive Queries -- A Preference-Based Framework for Updating Logic Programs -- Well-Founded Semantics and the Algebraic Theory of Non-monotone Inductive Definitions -- On the Complexity of Answer Set Programming with Aggregates -- Experimenting with Look-Back Heuristics for Hard ASP Programs -- Complexity of Rule Redundancy in Non-ground Answer-Set Programming over Finite Domains -- Conflict-Driven Answer Set Enumeration -- Head-Elementary-Set-Free Logic Programs -- A Deductive System for PC(ID) -- Modularity Aspects of Disjunctive Stable Models -- A Characterization of Strong Equivalence for Logic Programs with Variables -- A Unified Semantics for Constraint Handling Rules in Transaction Logic -- Conditional Planning with External Functions -- Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities -- General Default Logic -- System Descriptions -- The System: Logic Programming Meets Outlier Detection -- clasp: A Conflict-Driven Answer Set Solver -- GrinGo: A New Grounder for Answer Set Programming -- Using Answer Sets to Solve Belief Change Problems -- An Smodels System with Limited Lookahead Computation -- Programming Applications in CIFF -- CPP: A Constraint Logic Programming Based Planner with Preferences -- Posters -- An Application of Defeasible Logic Programming to Decision Making in a Robotic Environment -- On the Effectiveness of Looking Ahead in Search for Answer Sets -- Enhancing ASP Systems for Planning with Temporal Constraints -- Semantics for Possibilistic Disjunctive Programs -- Modularity in smodels Programs.