Complexity of Reasoning

We present lower bounds on the computational complexity of satisfiability and subsumption in several Description Logics. We interpret these lower bounds as coming from different "source, of complexity", which we isolate one by one. We consider both reasoning with simple concept expressions and reasoning with an underlying TBox. We discuss also complexity of instance checking in simple ABoxes. We have tried to enhance clarity and ease of presentation, sometimes sacrificing exhaustiveness for lack of space.

[1]  Ralf Küsters,et al.  Computing the Least Common Subsumer and the Most Specific Concept in the Presence of Cyclic ALN-Concept Descriptions , 1998, KI.

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

[3]  Robert Givan,et al.  Tarskian Set Constraints , 2002, Inf. Comput..

[4]  Bernhard Nebel,et al.  Terminological Reasoning is Inherently Intractable , 1990, Artif. Intell..

[5]  Toby Walsh,et al.  Beyond NP: the QSAT phase transition , 1999, AAAI/IAAI.

[6]  Edith Hemaspaandra.  The Complexity of Poor Man's Logic , 2001, J. Log. Comput..

[7]  Fabio Grandi,et al.  On Expressive Number Restrictions in Description Logics , 2001, Description Logics.

[8]  Ian Horrocks,et al.  Optimizing Description Logic Subsumption , 1999, J. Log. Comput..

[9]  Ian Horrocks,et al.  Practical Reasoning for Very Expressive Description Logics , 2000, Log. J. IGPL.

[10]  Yde Venema,et al.  Dynamic Logic by David Harel, Dexter Kozen and Jerzy Tiuryn. The MIT Press, Cambridge, Massachusetts. Hardback: ISBN 0–262–08289–6, $50, xv + 459 pages , 2002, Theory and Practice of Logic Programming.

[11]  Franz Baader.  Augmenting Concept Languages by Transitive Closure of Roles: An Alternative to Terminological Cycles , 1991, IJCAI.

[12]  Marco Schaerf,et al.  An Algorithm to Evaluate Quantified Boolean Formulae and Its Experimental Evaluation , 2002, Journal of Automated Reasoning.

[13]  Jos,et al.  The Complexity of Searching Implicit Graphs , 1996 .

[14]  Werner Nutt,et al.  A Refined Architecture for Terminological Systems: Terminology = Schema + Views , 1998, Artif. Intell..

[15]  Fabio Massacci.  Decision Procedures for Expressive Description Logics with Intersection, Composition, Converse of Roles and Role Identity , 2001, IJCAI.

[16]  Klaus Schild.  Towards a Theory of Frames and Rules , 1989 .

[17]  Ullrich Hustadt,et al.  On Evaluating Decision Procedures for Modal Logics , 1997 .

[18]  Franz Baader,et al.  On the Relation between Descripion Logics and Conceptual Graphs , 1998 .

[19]  Nancy E. Reed,et al.  Practical Reasoning , 1996, Lecture Notes in Computer Science.

[20]  Ulrike Sattler,et al.  The Hybrid µ-Calculus , 2001, IJCAR.

[21]  Franz Baader,et al.  A Terminological Knowledge Representation System with Complete Inference Algorithms , 1991, PDK.

[22]  Moshe Y. Vardi.  An Automata-Theoretic Approach to Linear Temporal Logic , 1996, Banff Higher Order Workshop.

[23]  James G. Schmolze,et al.  Classification in the KL-ONE Knowledge Representation System , 1983, IJCAI.

[24]  Francesco M. Donini,et al.  Deduction in Concept Languages: From Subsumption to Instance Checking , 1994, J. Log. Comput..

[25]  Andrea Schaerf.  Reasoning with Individuals in Concept Languages , 1993, AI*IA.

[26]  Nils J. Nilsson,et al.  Artificial Intelligence , 1974, IFIP Congress.

[27]  Jussi Rintanen,et al.  Improvements to the Evaluation of Quantified Boolean Formulae , 1999, IJCAI.

[28]  Peter F. Patel-Schneider,et al.  A Semantics and Complete Algorithm for Subsumption in the CLASSIC Description Logic , 1993, J. Artif. Intell. Res..

[29]  Gert Smolka,et al.  Attributive Concept Descriptions with Complements , 1991, Artif. Intell..

[30]  Werner Nutt,et al.  The Complexity of Existential Quantification in Concept Languages , 1992, Artif. Intell..

[31]  Francesco M. Donini,et al.  Using Terminological Reasoning in Hybrid Systems , 1990, AI Commun..

[32]  Richard E. Ladner,et al.  The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[33]  Andrea Schaerf.  Query Answering in Concept-Based Knowledge Representation Systems: Algorithms, Complexity, and Seman , 1994 .

[34]  Ian Horrocks,et al.  Using an Expressive Description Logic: FaCT or Fiction? , 1998, KR.

[35]  Andrea Schaerf,et al.  Reasoning with Individuals in Concept Languages , 1993, Data Knowl. Eng..

[36]  Werner Nutt,et al.  The Complexity of Concept Languages , 1997, KR.

[37]  Robert S. Streett,et al.  Propositional Dynamic Logic of Looping and Converse Is Elementarily Decidable , 1982, Inf. Control..

[38]  Hector J. Levesque,et al.  The Tractability of Subsumption in Frame-Based Description Languages , 1984, AAAI.

[39]  Paul Refenes,et al.  Reasoning and revision in hybrid representation systems by Bernhard Nevel, Springer-Verlag, Berlin, 1990, pp 270, DM 42 , 1991, The Knowledge Engineering Review.

[40]  Jean-Pierre Jouannaud,et al.  Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[41]  Bernhard Nebel,et al.  Computational Complexity of Terminological Reasoning in BACK , 1988, Artif. Intell..

[42]  Klaus Schild,et al.  A Correspondence Theory for Terminological Logics: Preliminary Report , 1991, IJCAI.

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

[44]  Pierre Wolper,et al.  Automata theoretic techniques for modal logics of programs: (Extended abstract) , 1984, STOC '84.

[45]  Vaughan R. Pratt,et al.  Models of program logics , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[46]  Leonid Libkin,et al.  Logics with counting and local properties , 2000, TOCL.

[47]  Peter F. Patel-Schneider,et al.  Undecidability of Subsumption in NIKL , 1989, Artif. Intell..

[48]  Richard E. Ladner,et al.  Propositional Dynamic Logic of Regular Programs , 1979, J. Comput. Syst. Sci..

[49]  Stephan Tobies.  PSPACE Reasoning for Graded Modal Logics , 2001, J. Log. Comput..

[50]  Alan P. Parkes.  Logic and Computation , 2002 .

[51]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[52]  Moshe Y. Vardi.  The complexity of relational query languages (Extended Abstract) , 1982, STOC '82.

[53]  Edward A. Feigenbaum,et al.  Artificial intelligence research , 1963, IEEE Trans. Inf. Theory.

[54]  Peter F. Patel-Schneider,et al.  A Four-Valued Semantics for Terminological Logics , 1989, Artif. Intell..

[55]  Francesco M. Donini,et al.  Decidable Reasoning in Terminological Knowledge Representation Systems , 1993, IJCAI.

[56]  Francesco M. Donini,et al.  Exptime Tableaux for ALC , 2000, Description Logics.

[57]  Diego Calvanese.  Reasoning with Inclusion Axioms in Description Logics: Algorithms and Complexity , 1996, ECAI.

[58]  Moshe Y. Vardi.  Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.

[59]  Carsten Lutz.  NEXPTIME-Complete Description Logics with Concrete Domains , 2001, IJCAR.

[60]  Carsten Lutz.  Interval-based Temporal Reasoning with General TBoxes , 2001, IJCAI.

[61]  Ullrich Hustadt,et al.  On Evaluating Decision Procedures for Modal Logic , 1997, IJCAI.

[62]  Franz Baader,et al.  Number Restrictions on Complex Roles in Description Logics: A Preliminary Report , 1996, KR.

[63]  Werner Nutt,et al.  Tractable Concept Languages , 1991, IJCAI.

[64]  Hector J. Levesque,et al.  Expressiveness and tractability in knowledge representation and reasoning 1 , 1987, Comput. Intell..

[65]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[66]  Bernhard Nebel,et al.  An Empirical Analysis of Optimization Techniques for Terminological Representation Systems, or Making KRIS Get a Move On , 1992, KR.

[67]  Andrea Schaerf,et al.  On the complexity of the instance checking problem in concept languages with existential quantification , 1993, Journal of Intelligent Information Systems.

[68]  Franz Baader,et al.  A Scheme for Integrating Concrete Domains into Concept Languages , 1991, IJCAI.

[69]  Ulrike Sattler,et al.  The Complexity of Reasoning with Boolean Modal Logics , 2000, Advances in Modal Logic.

[70]  Werner Nutt,et al.  Terminological Systems Revisited: Terminology = Schema + Views , 1994, KRDB.