Principles of Knowledge Representation and Reasoning

June 24, 2008 — Qualitative Representation and Reasoning II: Allen’s Interval Calculus Allen’s Interval Calculus Motivation Intervals and Relations Between Them Processing an Example Composition Table Outlook Reasoning in Allen’s Interval Calculus Constraint propagation algorithms (enforcing path consistency) Example for Incompleteness NP-Hardness Example The Continuous Endpoint Class Completeness for the CEP Class A Maximal Tractable Sub-Algebra The Endpoint Subclass The ORD-Horn Subclass Maximality Solving Arbitrary Allen CSPs Literature Nebel, Helmert, Wolfl (Uni Freiburg) KRR June 24, 2008 2 / 41

[1]  Bernhard Nebel,et al.  Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class , 1997, Constraints.

[2]  Diego Calvanese,et al.  The description logic handbook: theory , 2003 .

[3]  Peter Jeavons,et al.  A Complete Classification of Complexity in Allens Algebra in the Presence of a Non-Trivial Basic Relation , 2001, IJCAI.

[4]  Bernhard Nebel,et al.  Efficient Methods for Qualitative Spatial Reasoning , 2001, J. Artif. Intell. Res..

[5]  Wolfgang Faber,et al.  Declarative problem-solving using the DLV system , 2000 .

[6]  John F. Sowa,et al.  Knowledge Representation and Reasoning , 2000 .

[7]  Werner Nutt.  On the Translation of Qualitative Spatial Reasoning Problems into Modal Logics , 1999, KI.

[8]  Bernhard Nebel,et al.  Preferred Arguments are Harder to Compute than Stable Extension , 1999, IJCAI.

[9]  Bernhard Nebel,et al.  On the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of the Region Connection Calculus , 1999, Artif. Intell..

[10]  Christos H. Papadimitriou,et al.  Elements of the Theory of Computation , 1997, SIGA.

[11]  Domenico Saccà,et al.  The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries , 1997, J. Comput. Syst. Sci..

[12]  Bernhard Nebel,et al.  Artificial intelligence: a computational perspective , 1997 .

[13]  Bernhard Nebel,et al.  How Hard is it to Revise a Belief Base , 1996 .

[14]  Bernhard Nebel,et al.  Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra , 1994, JACM.

[15]  Marco Schaerf,et al.  A Survey of Complexity Results for Nonmonotonic Logics , 1993, J. Log. Program..

[16]  John F. Sowa,et al.  Principles of semantic networks , 1991 .

[17]  Grigoris Antoniou,et al.  Logic - a foundation for computer science , 1991, International Computer Science Series.

[18]  Werner Nutt,et al.  Terminological Knowledge Representation: A Proposal for a Terminological Logic , 1991, Description Logics.

[19]  Bernhard Nebel,et al.  Belief Revision and Default Reasoning: Syntax-Based Approaches , 1991, KR.

[20]  Peter Gärdenfors,et al.  Belief Revision and Nonmonotonic Logic: Two Sides of the Same Coin? (Abstract) , 1990, JELIA.

[21]  Bernhard Nebel,et al.  Reasoning and Revision in Hybrid Representation Systems , 1990, Lecture Notes in Computer Science.

[22]  Paolo Atzeni,et al.  Set Containment Inference and Syllogisms , 1988, Theor. Comput. Sci..

[23]  P G rdenfors,et al.  Knowledge in flux: modeling the dynamics of epistemic states , 1988 .

[24]  V. Lifschitz,et al.  The Stable Model Semantics for Logic Programming , 1988, ICLP/SLP.

[25]  Peter Gärdenfors,et al.  On the logic of theory change: Partial meet contraction and revision functions , 1985, Journal of Symbolic Logic.

[26]  Ronald J. Brachman,et al.  An Overview of the KL-ONE Knowledge Representation System , 1985, Cogn. Sci..

[27]  Dov M. Gabbay,et al.  Theoretical Foundations for Non-Monotonic Reasoning in Expert Systems , 1989, Logics and Models of Concurrent Systems.

[28]  James F. Allen.  Maintaining knowledge about temporal intervals , 1983, CACM.

[29]  Nicholas V. Findler,et al.  Associative Networks- Representation and Use of Knowledge by Computers , 1980, CL.

[30]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[31]  Marvin Minsky,et al.  A framework for representing knowledge , 1974 .

[32]  M R Quillian,et al.  Word concepts: a theory and simulation of some basic semantic capabilities. , 1967, Behavioral science.

[33]  Hans Hahn.  Einführung in die Mathematische Logik , 1932 .