Description Logics for Ontologies

Description logics (DLs) [6,8,21] are a family of logic-based knowledge representation formalisms designed to represent and reason about the knowledge of an application domain in a structured and well-understood way.

[1]  Manfred Schmidt-Schauß,et al.  Subsumption in KL-ONE is Undecidable , 1989, KR.

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

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

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

[5]  Nicholas Zvegintzov.  Structured representation of FMS integrating SI-NETS and high level petri nets , 1990 .

[6]  Jerzy Tiuryn,et al.  Logics of Programs , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[7]  Nicola Guarino,et al.  Formal ontology, conceptual analysis and knowledge representation , 1995, Int. J. Hum. Comput. Stud..

[8]  Ian Horrocks,et al.  A Description Logic with Transitive and Inverse Roles and Role Hierarchies , 1999, J. Log. Comput..

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

[10]  Franz Baader,et al.  A Formal Definition for the Expressive Power of Terminological Knowledge Representation Languages , 1996, J. Log. Comput..

[11]  Ulrike Sattler,et al.  The complexity of finite model reasoning in description logics , 2005, Inf. Comput..

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

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

[14]  Stefan Schulz,et al.  Parts, Locations, and Holes - Formal Reasoning about Anatomical Structures , 2001, AIME.

[15]  Moshe Y. Vardi.  The Taming of Converse: Reasoning about Two-way Computations , 1985, Logic of Programs.

[16]  Ulrike Sattler,et al.  The Complexity of the Graded µ-Calculus , 2002, CADE.

[17]  Alan L. Rector.  Analysis of propagation along transitive roles: Formalisation of the GALEN experience with Medical Ontologies , 2002, Description Logics.

[18]  Alex K. Simpson,et al.  Computational Adequacy in an Elementary Topos , 1998, CSL.

[19]  Carsten Lutz,et al.  Description Logics with Concrete Domains-A Survey , 2002, Advances in Modal Logic.

[20]  Johan van Benthem,et al.  Time, logic and computation , 1988, REX Workshop.

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

[22]  R GruberThomas.  Toward principles for the design of ontologies used for knowledge sharing , 1995 .

[23]  Neil Immerman,et al.  Descriptive Complexity and Finite Models , 1997 .

[24]  Ian Horrocks,et al.  OIL: An Ontology Infrastructure for the Semantic Web , 2001, IEEE Intell. Syst..

[25]  Patrick Blackburn,et al.  Internalizing labelled deduction , 2000, J. Log. Comput..

[26]  G Stix,et al.  The mice that warred. , 2001, Scientific American.

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

[28]  Ramanathan V. Guha,et al.  Building large knowledge-based systems , 1989 .

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

[30]  Douglas Herrmann,et al.  A Taxonomy of Part-Whole Relations , 1987, Cogn. Sci..

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

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

[33]  Stephan Tobies,et al.  A Tableau Algorithm for the Clique Guarded Fragment , 2000, Advances in Modal Logic.

[34]  Theodore A. Slaman,et al.  Mathematical Logic and Applications , 1989 .

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

[36]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

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

[38]  Ralf Küsters,et al.  Approximation and Difference in Description Logics , 2002, KR.

[39]  Stéphane Demri,et al.  Automata-Theoretic Decision Procedures for Information Logics , 2002, Fundam. Informaticae.

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

[41]  Simone Pribbenow,et al.  Midwinters, end games, and body parts: a classification of part-whole relations , 1995, Int. J. Hum. Comput. Stud..

[42]  Laura Giordano,et al.  A Tableau for Multimodal Logics and Some (Un)Decidability Results , 1998, TABLEAUX.

[43]  Frank van Harmelen,et al.  Reviewing the design of DAML+OIL: an ontology language for the semantic web , 2002, AAAI/IAAI.

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

[45]  Beata Konikowska,et al.  A Logic for Reasoning about Relative Similarity , 1997, Stud Logica.

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

[47]  D. Bernardi.  Reasoning on UML Class Diagrams using Description Logic Based Systems , 2001 .

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

[49]  Ian Horrocks,et al.  The GRAIL concept modelling language for medical terminology , 1997, Artif. Intell. Medicine.

[50]  Johan van Benthem,et al.  Modal Languages and Bounded Fragments of Predicate Logic , 1998, J. Philos. Log..

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

[52]  Maarten de Rijke,et al.  Counting Objects , 1995, J. Log. Comput..

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

[54]  Steffen Staab,et al.  OntoEdit: Guiding Ontology Development by Methodology and Inferencing , 2002, OTM.

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

[56]  M. Baldoni.  Normal Multimodal Logics: Automatic Deduction and Logic Programming Extension , 1998 .

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

[58]  Diego Calvanese,et al.  Structured Objects: Modeling and Reasoning , 1995, DOOD.

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

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

[61]  Volker Haarslev,et al.  RACER System Description , 2001, IJCAR.

[62]  Ullrich Hustadt,et al.  MSPASS: Modal Reasoning by Translation and First-Order Resolution , 2000, TABLEAUX.

[63]  Ian Horrocks,et al.  DLP and FaCT , 1999, TABLEAUX.

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

[65]  Ian Horrocks,et al.  OilEd: a Reason-able Ontology Editor for the Semantic Web , 2001, Description Logics.

[66]  Moshe Y. Vardi.  Reasoning about The Past with Two-Way Automata , 1998, ICALP.

[67]  Michael Kifer,et al.  Deductive and Object-Oriented Databases , 1991 .

[68]  Alan Robinson,et al.  The Inverse Method , 2001, Handbook of Automated Reasoning.

[69]  Stéphane Demri,et al.  The Complexity of Regularity in Grammar Logics and Related Modal Logics , 2001, Journal of Logic and Computation.

[70]  Michael Wessel,et al.  Obstacles on the Way to Qualitative Spatial Reasoning with Description Logics: Some Undecidability Results , 2001, Description Logics.

[71]  D. Holdstock.  Past, present--and future? , 2005, Medicine, conflict, and survival.

[72]  Tim Berners-Lee,et al.  Weaving The Web: The Original Design And Ultimate Destiny of the World Wide Web , 1999 .

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

[74]  Ullrich Hustadt,et al.  Hyperresolution for guarded formulae , 2003, J. Symb. Comput..

[75]  Günther Görz,et al.  KI-96: Advances in Artificial Intelligence , 1996, Lecture Notes in Computer Science.

[76]  Kit Fine,et al.  The Study of Ontology , 1991 .

[77]  Zdzislaw Pawlak,et al.  Information systems theoretical foundations , 1981, Inf. Syst..

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

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

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

[81]  Ralf Küsters,et al.  Matching under Side Conditions in Description Logics , 2001, IJCAI.

[82]  Orna Kupferman,et al.  Weak alternating automata and tree automata emptiness , 1998, STOC '98.

[83]  Ian Horrocks.  The FaCT System , 1998, TABLEAUX.

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

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

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

[87]  Ian Horrocks,et al.  Optimised Reasoning for SHIQ , 2002, ECAI.

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

[89]  Dexter Kozen,et al.  RESULTS ON THE PROPOSITIONAL’p-CALCULUS , 2001 .

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

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

[92]  Ian Horrocks,et al.  Practical Reasoning for Expressive Description Logics , 1999, LPAR.

[93]  Ian Horrocks,et al.  Decidability of SHIQ with Complex Role Inclusion Axioms , 2003, IJCAI.

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

[95]  Paolo Terenziani.  Towards a causal ontology coping with the temporal constraints between causes and effects , 1995, Int. J. Hum. Comput. Stud..

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

[97]  Jan L. Top,et al.  Engineering ontologies , 1997, Int. J. Hum. Comput. Stud..

[98]  Mordechai Ben-Ari,et al.  Deterministic Propositional Dynamic Logic: Finite Models, Complexity, and Completeness , 1982, J. Comput. Syst. Sci..

[99]  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.

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

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

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

[103]  Ian Horrocks,et al.  Experience building a Large, Re-usable Medical Ontology using a Description Logic with Transitivity and Concept Inclusions , 1997 .

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

[105]  M. de Rijke,et al.  Diamonds and Defaults , 1993 .

[106]  R. Lathe.  Phd by thesis , 1988, Nature.

[107]  Giuseppe De Giacomo,et al.  Reasoning on UML Class Diagrams using Description Logic Based Systems , 2001 .

[108]  Ian Horrocks,et al.  Description Logics with Transitive Roles , 1997, Description Logics.

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

[110]  Maurizio Lenzerini,et al.  Concept Language with Number Restrictions and Fixpoints, and its Relationship with Mu-calculus , 1994, ECAI.

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

[112]  Ian Horrocks,et al.  Optimised Reasoning for {$\mathcal SHIQ$} , 2002 .

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

[114]  Maarten Marx,et al.  The Computational Complexity of Hybrid Temporal Logics , 2000, Log. J. IGPL.

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

[116]  James K. Feibleman.  Of Symbolic Logic , 1979 .

[117]  James A. Hendler,et al.  The Semantic Web" in Scientific American , 2001 .

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

[119]  Ulrike Sattler,et al.  BDD-Based Decision Procedures for K , 2002, CADE.

[120]  Franz Baader,et al.  Using automata theory for characterizing the semantics of terminological cycles , 1996, Annals of Mathematics and Artificial Intelligence.

[121]  E. Allen Emerson,et al.  An Automata Theoretic Decision Procedure for the Propositional Mu-Calculus , 1989, Inf. Comput..

[122]  Alasdair Urquhart,et al.  Temporal Logic , 1971 .

[123]  Jan Hladik.  Implementation and Optimisation of a Tableau Algorithm for the Guarded Fragment , 2002, TABLEAUX.

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

[125]  Ian Horrocks,et al.  Building a bioinformatics ontology using OIL , 2002, IEEE Transactions on Information Technology in Biomedicine.

[126]  Diego Calvanese,et al.  A Unified Framework for Class-Based Representation Formalisms , 1994, KR.

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

[128]  Frank Pfenning,et al.  Logic Programming and Automated Reasoning , 1994, Lecture Notes in Computer Science.

[129]  Franz Baader,et al.  On the Problem of Computing Small Representations of Least Common Subsumers , 2002, KI.

[130]  Roy Dyckhoff.  Automated Reasoning with Analytic Tableaux and Related Methods , 2000, Lecture Notes in Computer Science.

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

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

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

[134]  Ian Horrocks,et al.  A Description Logic Based Schema for the Classification of Medical Data , 1996, KRDB.

[135]  斉藤 康己,et al.  Douglas B. Lenat and R. V. Guha : Building Large Knowledge-Based Systems, Representation and Inference in the Cyc Project, Addison-Wesley (1990). , 1990 .

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

[137]  Peter F. Patel-Schneider,et al.  The Generation of DAML+OIL , 2001, Description Logics.

[138]  Carsten Lutz,et al.  The complexity of description logics with concrete domains , 2002 .

[139]  Peter Øhrstrøm,et al.  Temporal Logic , 1994, Lecture Notes in Computer Science.

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

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

[142]  Bernhard Nebel,et al.  Am empirical analysis of optimization techniques for terminological representation systems , 1994, Applied Intelligence.

[143]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

[144]  P. Simons.  Parts: A Study in Ontology , 1991 .

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

[146]  Larry Wos,et al.  What Is Automated Reasoning? , 1987, J. Autom. Reason..

[147]  Dexter Kozen,et al.  Results on the Propositional µ-Calculus , 1982, ICALP.

[148]  Maurizio Lenzerini,et al.  TBox and ABox Reasoning in Expressive Description Logics , 1996, KR.

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

[150]  Franz Baader,et al.  An Overview of Tableau Algorithms for Description Logics , 2001, Stud Logica.

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

[152]  E. Allen Emerson,et al.  Temporal and Modal Logic , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[153]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[154]  Enrico Franconi,et al.  The i.com tool for Intelligent Conceptual Modeling , 2000, KRDB.

[155]  Ulrike Sattler,et al.  A Suggestion for an n-ary Description Logic , 1999, Description Logics.

[156]  Michael Uschold,et al.  The Enterprise Ontology , 1998, The Knowledge Engineering Review.

[157]  Gerhard Lakemeyer,et al.  KI 2002: Advances in Artificial Intelligence , 2002, Lecture Notes in Computer Science.

[158]  G. Duclos.  New York 1987 , 2000 .

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

[160]  Peter F. Patel-Schneider,et al.  The CLASSIC knowledge representation system: guiding principles and implementation rationale , 1991, SGAR.

[161]  Ian Horrocks,et al.  Decidability of {$\mathcal SHIQ$} with Complex Role Inclusion Axioms , 2003, IJCAI 2003.