The complexity of description logics with concrete domains

[1]  Giuseppe De Giacomo,et al.  Reasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees , 1999, IJCAI.

[2]  Franz Baader.  A Formal Definition for the Expressive Power of Knowledge Representation Languages , 1990, ECAI.

[3]  A. Wilkie.  THE CLASSICAL DECISION PROBLEM (Perspectives in Mathematical Logic) By Egon Börger, Erich Grädel and Yuri Gurevich: 482 pp., DM.158.–, ISBN 3 540 57073 X (Springer, 1997). , 1998 .

[4]  H. Chertkow,et al.  Semantic memory , 2002, Current neurology and neuroscience reports.

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

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

[7]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[8]  Claudio Bettini,et al.  Time-Dependent Concepts: Representation and Reasoning Using Temporal Description Logics , 1997, Data Knowl. Eng..

[9]  Carsten Lutz,et al.  A Correspondence between Temporal Description Logics , 2004, J. Appl. Non Class. Logics.

[10]  Carsten Lutz,et al.  Reasoning with Concrete Domains , 1999, IJCAI.

[11]  M. W. Shields.  An Introduction to Automata Theory , 1988 .

[12]  Projektgruppe WINOPostfa.  A Terminological Knowledge Representation System with Complete Inference Algorithms , 1991 .

[13]  Anthony G. Cohn,et al.  A Spatial Logic based on Regions and Connection , 1992, KR.

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

[15]  Ralf Küsters.  Non-Standard Inferences in Description Logics , 2001, Lecture Notes in Computer Science.

[16]  Marcus Kracht,et al.  Properties of independently axiomatizable bimodal logics , 1991, Journal of Symbolic Logic.

[17]  Diego Calvanese,et al.  The Description Logic Handbook: Theory, Implementation, and Applications , 2003, Description Logic Handbook.

[18]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[19]  Ian Horrocks,et al.  Ontology Reasoning in the SHOQ(D) Description Logic , 2001, IJCAI.

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

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

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

[23]  Enrico Franconi,et al.  A Temporal Description Logic for Reasoning about Actions and Plans , 1998, J. Artif. Intell. Res..

[24]  R. Goldblatt.  Logics of Time and Computation , 1987 .

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

[26]  Robert L. Berger.  The undecidability of the domino problem , 1966 .

[27]  Ronald J. Brachman,et al.  An overview of the KL-ONE Knowledge Representation System , 1985 .

[28]  Brandon Bennett,et al.  Modal Logics for Qualitative Spatial Reasoning , 1996, Log. J. IGPL.

[29]  Ulrike Sattler,et al.  A Concept Language Extended with Different Kinds of Transitive Roles , 1996, KI.

[30]  Ian Horrocks,et al.  Optimising Tableaux Decision Procedures For Description Logics , 1997 .

[31]  Carsten Lutz,et al.  Defined Topological Relations in Description Logics , 1997, Description Logics.

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

[33]  Diego Calvanese,et al.  Reasoning in Expressive Description Logics , 2001, Handbook of Automated Reasoning.

[34]  Emil L. Post.  A variant of a recursively unsolvable problem , 1946 .

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

[36]  Carsten Lutz,et al.  A Tableau Decision Algorithm for Modalized ALC with Constant Domains , 2002, Stud Logica.

[37]  Diego Calvanese,et al.  Unrestricted and finite model reasoning in class-based representation formalisms , 1996 .

[38]  W. Nutt,et al.  Subsumption algorithms for concept languages , 1990 .

[39]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[40]  François Rousselot,et al.  A Description Logic Model for Reacting in a Dynamic Environment , 2000, Description Logics.

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

[42]  E. Szpilrajn.  Sur l'extension de l'ordre partiel , 1930 .

[43]  Edith Spaan.  The Complexity of Propositional Tense Logics , 1993 .

[44]  Stephan Tobies,et al.  Complexity results and practical algorithms for logics in knowledge representation , 2001, ArXiv.

[45]  Martin D. Davis.  Hilbert's Tenth Problem is Unsolvable , 1973 .

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

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

[48]  Ulrike Sattler,et al.  Mary Likes all Cats , 2000, Description Logics.

[49]  Matthew L. Ginsberg,et al.  Essentials of Artificial Intelligence , 2012 .

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

[51]  Erich Grädel,et al.  On the Restraining Power of Guards , 1999, Journal of Symbolic Logic.

[52]  Ulrike Sattler,et al.  Terminological knowledge representation systems in a process engineering application , 1998 .

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

[54]  Robert Goldblatt,et al.  Semantic analysis of orthologic , 1974, J. Philos. Log..

[55]  Henry H. Leitner,et al.  Structured Inheritance Networks and Natural Language Understanding , 1979, IJCAI.

[56]  Andreas Abecker,et al.  TAXON: A Concept Language with Concrete Domains , 1991, PDK.

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

[58]  Diego Calvanese,et al.  Answering Queries Using Views over Description Logics Knowledge Bases , 2000, AAAI/IAAI.

[59]  Franz Baader,et al.  Tractable and Decidable Fragments of Conceptual Graphs , 1999, ICCS.

[60]  Volker Haarslev,et al.  The Description Logic ALCNHR+ Extended with Concrete Domains: A Practically Motivated Approach , 2000, IJCAR.

[61]  Klaus Schild,et al.  Terminological Cycles and the Propositional µ-Calculus , 1994, KR.

[62]  Ulrike Sattler.  Description Logics for the Representation of Aggregated Objects , 2000, ECAI.

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

[64]  Ian Horrocks,et al.  Reasoning with Individuals for the Description Logic SHIQ , 2000, CADE.

[65]  Enrico Franconi,et al.  Temporal ER Modeling with Description Logics , 1999, ER.

[66]  Carsten Lutz,et al.  Complexity of Terminological Reasoning Revisited , 1999, LPAR.

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

[68]  Ulrike Sattler,et al.  Modal Logic and the Two-Variable Fragment , 2001, CSL.

[69]  Franz Baader,et al.  Extensions of Concept Languages for a Mechanical Engineering Application , 1992, GWAI.

[70]  Phokion G. Kolaitis,et al.  On the Decision Problem for Two-Variable First-Order Logic , 1997, Bulletin of Symbolic Logic.

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

[72]  Yuri Gurevich,et al.  The Classical Decision Problem , 1997, Perspectives in Mathematical Logic.

[73]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[74]  S. Griffis.  EDITOR , 1997, Journal of Navigation.

[75]  Igor Walukiewicz,et al.  Guarded fixed point logic , 1999, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158).

[76]  Volker Haarslev,et al.  Consistency Testing: The RACE Experience , 2000, TABLEAUX.

[77]  Franz Baader,et al.  Description Logics with Concrete Domains and Aggregation , 1998, ECAI.

[78]  Christos H. Papadimitriou,et al.  Computational complexity , 1993 .

[79]  Diego Calvanese,et al.  Description Logics for Conceptual Data Modeling , 1998, Logics for Databases and Information Systems.

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

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

[82]  Klaus Schild,et al.  Combining Terminological Logics with Tense Logic , 1993, EPIA.

[83]  Valentin Goranko,et al.  Using the Universal Modality: Gains and Questions , 1992, J. Log. Comput..

[84]  Franz Baader,et al.  Cardinality Restrictions on Concepts , 1994, KI.

[85]  Alexander Borgida,et al.  On the Relative Expressiveness of Description Logics and Predicate Logics , 1996, Artif. Intell..

[86]  Werner Nutt,et al.  On the expressivity of feature logics with negation, functional uncertainty, and sort equations , 1993, J. Log. Lang. Inf..

[87]  Ralf Molitor,et al.  Unterstützung der Modellierung verfahrenstechnischer Prozesse durch Nicht-Standardinferenzen in Beschreibungslogiken , 2000, Ausgezeichnete Informatikdissertationen.

[88]  Carsten Lutz,et al.  NEXP TIME-complete description logics with concrete domains , 2004, TOCL.

[89]  Ian Horrocks,et al.  FaCT and iFaCT , 1999, Description Logics.

[90]  Franz Baader,et al.  Tableau Algorithms for Description Logics , 2000, TABLEAUX.

[91]  Yoav Shoham,et al.  A propositional modal logic of time intervals , 1991, JACM.

[92]  Franz Baader,et al.  Qualifying Number Restrictions in Concept Languages , 1991, KR.

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

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

[95]  Carsten Lutz,et al.  Tableaux for Temporal Description Logic with Constant Domains , 2001, IJCAR.

[96]  Ralf Küsters.  Characterizing the Semantics of Terminological Cycles in ALN Using Finite Automata , 1998, KR.

[97]  Bernhard Nebel,et al.  Terminological Cycles: Semantics and Computational Properties , 1991, Principles of Semantic Networks.

[98]  Ian Horrocks,et al.  OIL in a Nutshell , 2000, EKAW.

[99]  F. Wolter,et al.  Temporalizing Description Logics , 1998, FroCoS.

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

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

[102]  Peter B. Ladkin,et al.  On binary constraint problems , 1994, JACM.

[103]  Franz Baader,et al.  Fusions of Description Logics and Abstract Description Systems , 2011, J. Artif. Intell. Res..

[104]  Jon Doyle,et al.  Principles of knowledge representation and reasoning : proceedings of the fourth international conference (KR'94), Bonn, Germany, May 24-27, 1994 , 1994 .

[105]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[106]  D. Kozen.  Results on the Propositional µ-Calculus , 1982 .

[107]  Ullrich Hustadt,et al.  Issues of Decidability for Description Logics in the Framework of Resolution , 1998, FTP.

[108]  G. Sacks.  A DECISION METHOD FOR ELEMENTARY ALGEBRA AND GEOMETRY , 2003 .

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

[110]  G. Kamp,et al.  CTL : a description logic with expressive concrete domains , 1996 .

[111]  Ulrike Sattler,et al.  Description Logics and the Two-Variable Fragment , 2001, Description Logics.

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

[113]  Franz Baader,et al.  Terminological Cycles in KL-ONE-based Knowledge Representation Languages , 1990, AAAI.

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

[115]  Volker Haarslev,et al.  Expressive ABox Reasoning with Number Restrictions, Role Hierarchies, and Transitively Closed Roles , 2000, KR.

[116]  Kit Fine,et al.  In so many possible worlds , 1972, Notre Dame J. Formal Log..

[117]  Edith Hemaspaandra,et al.  The Price of Universality , 1996, Notre Dame J. Formal Log..

[118]  Peter van Beek,et al.  Exact and approximate reasoning about temporal relations 1 , 1990, Comput. Intell..

[119]  Peter F. Patel-Schneider,et al.  Living wiht Classic: When and How to Use a KL-ONE-Like Language , 1991, Principles of Semantic Networks.

[120]  Tinko Tinchev,et al.  Modal Environment for Boolean Speculations , 1987 .

[121]  Maarten Marx,et al.  A Road-Map on Complexity for Hybrid Logics , 1999, CSL.

[122]  Michael Zakharyaschev,et al.  Modal Logic , 1997, Oxford logic guides.

[123]  J.F.A.K. van Benthem,et al.  Modal logic and classical logic , 1983 .

[124]  Volker Haarslev,et al.  A Description Logic with Concrete Domains and a Role-forming Predicate Operator , 1999, J. Log. Comput..

[125]  Manfred Schmidt-Schaubß,et al.  Subsumption in KL-ONE is undecidable , 1989, KR 1989.

[126]  Franz Baader,et al.  KRIS: Knowledge Representation and Inference System , 1991, SGAR.

[127]  Diego Calvanese,et al.  Containment of Conjunctive Regular Path Queries with Inverse , 2000, KR.

[128]  Philipp Hanschke,et al.  Specifying Role Interaction in Concept Languages , 1992, KR.

[129]  Bernd Owsnicki-Klewe,et al.  Data Models in Knowledge Representation System: A Case Study , 1986, GWAI.

[130]  A. Meyer,et al.  The complexity of the word problems for commutative semigroups and polynomial ideals , 1982 .

[131]  Maurizio Lenzerini,et al.  Boosting the Correspondence between Description Logics and Propositional Dynamic Logics , 1994, AAAI.

[132]  Henry A. Kautz,et al.  Constraint propagation algorithms for temporal reasoning: a revised report , 1989 .

[133]  Volker Haarslev,et al.  A Concept Language with Role-Forming Predicate Restrictions , 1998 .

[134]  Franz Baader,et al.  Logic-Based Knowledge Representation , 1999, Artificial Intelligence Today.

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

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