Non-Standard Inferences in Description Logics : The Story So Far

Description logics (DLs) are a successful family of logic-based knowledge representation formalisms that can be used to represent the terminological knowledge of an application domain in a structured and formally well-founded way. DL systems provide their users with inference procedures that allow to reason about the represented knowledge. Standard inference problems (such as the subsumption and the instance problem) are now well-understood. Their computational properties (such as decidability and complexity) have been investigated in detail, and modern DL systems are equipped with highly optimized implementations of these inference procedures, which—in spite of their high worst-case complexity—perform quite well in practice. In applications of DL systems it has turned out that building and maintaining large DL knowledge bases can be further facilitated by procedures for other, nonstandard inference problem, such as computing the least common subsumer and the most specific concept, and rewriting and matching of concepts. While the research concerning these non-standard inferences is not as mature as the one for the standard inferences, it has now reached a point where it makes sense to motivate these inferences within a uniform application framework, give an overview of the results obtained so far, describe the remaining open problems, and give perspectives for future research in this direction.

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

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

[3]  Steven W. Reyner,et al.  An Analysis of a Good Algorithm for the Subtree Problem , 1977, SIAM J. Comput..

[4]  David S. Johnson,et al.  Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .

[5]  H. Levesque,et al.  Readings in Knowledge Representation , 1985 .

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

[7]  Deborah L. McGuinness,et al.  CLASSIC: a structural data model for objects , 1989, SIGMOD '89.

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

[9]  Bernhard Hollunder.  Hybrid Inferences in KL-ONE-Based Knowledge Representation Systems , 1990, GWAI.

[10]  Bernhard Hollunder,et al.  Subsumption Algorithms for Concept Description Languages , 1990, ECAI.

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

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

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

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

[15]  Christof Peltason.  The BACK system—an overview , 1991, SGAR.

[16]  Robert Mac Gregor,et al.  THE EVOLVING TECHNOLOGY OF CLASSIFICATION-BASED KNOWLEDGE REPRESENTATION SYSTEMS , 1991 .

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

[18]  Eric Mays,et al.  K-Rep system overview , 1991, SGAR.

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

[20]  M. Chein,et al.  Conceptual graphs: fundamental notions , 1992 .

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

[22]  James G. Schmolze,et al.  The KL-ONE family , 1992 .

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

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

[25]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

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

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

[28]  William W. Cohen,et al.  Learning the Classic Description Logic: Theoretical and Experimental Results , 1994, KR.

[29]  Gunnar Teege.  Making the Difference: A Subtraction Operation for Description Logics , 1994, KR.

[30]  Sergio Tessaris,et al.  Implementing and Testing Expressive Description Logics: a Preliminary Report , 1995 .

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

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

[33]  Deborah L. McGuinness,et al.  Asking Queries about Frames , 1996, KR.

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

[35]  Paliath Narendran,et al.  Unification of Concept Terms in Description Logics , 2001, Description Logics.

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

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

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

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

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

[41]  DL Systems Comparison , 1998 .

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

[43]  Deborah L. McGuinness,et al.  Matching in Description Logics , 1999, J. Log. Comput..

[44]  Franz Baader,et al.  Expressive Number Restrictions in Description Logics , 1999, J. Log. Comput..

[45]  Ralf Küsters,et al.  Matching in Description Logics with Existential Restrictions , 1999, Description Logics.

[46]  Ralf Küsters,et al.  Computing Least Common Subsumers in Description Logics with Existential Restrictions , 1999, IJCAI.

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

[48]  Stefan Schulz,et al.  Knowledge Engineering by Large-Scale Knowledge Reuse - Experience from the Medical Domain , 2000, KR.

[49]  Wolfgang Marquardt,et al.  Rome: A repository to support the integration of models over the lifecycle of model-based engineering processes , 2000 .

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

[51]  Ralf Küsters,et al.  Rewriting Concepts Using Terminologies , 2000, KR.

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

[53]  Wolfgang Marquardt,et al.  Computer-aided process modeling with MODKIT , 2001 .

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

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

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

[57]  Alexander Borgida,et al.  What's in an Attribute? Consequences for the Least Common Subsumer , 2001, J. Artif. Intell. Res..

[58]  Anni-Yasmin Turhan,et al.  Using Non-standard Inferen es in Des ription Logi s | what does it buy me ? , 2001 .

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

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

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

[62]  Volker Haarslev,et al.  High Performance Reasoning with Very Large Knowledge Bases: A Practical Case Study , 2001, IJCAI.

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

[64]  Ralf Küsters,et al.  Unification in a Description Logic with Transitive Closure of Roles , 2001, LPAR.

[65]  Ralf Küsters,et al.  Computing Least Common Subsumers in ALEN , 2001, IJCAI.

[66]  Ralf Küsters,et al.  Approximating most specific concepts in description logics with existential restrictions , 2002, AI Commun..

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

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

[69]  Ralf Küsters,et al.  Unification in a Description Logic with Inconsistency and Transitive Closure of Roles , 2002, Description Logics.

[70]  Ian Horrocks,et al.  Description Logics for the Semantic Web , 2002, Künstliche Intell..

[71]  Ian Horrocks,et al.  From SHIQ and RDF to OWL: the making of a Web Ontology Language , 2003, J. Web Semant..

[72]  Ralf Küsters,et al.  Extensions to Description Logics , 2003, Description Logic Handbook.

[73]  Werner Nutt,et al.  Basic Description Logics , 2003, Description Logic Handbook.

[74]  Franz Baader.  The Instance Problem and the Most Specific Concept in the Description Logic EL w.r.t. Terminological Cycles with Descriptive Semantics , 2003, KI.

[75]  Franz Baader.  Least Common Subsumers and Most Specific Concepts in a Description Logic with Existential Restrictions and Terminological Cycles , 2003, IJCAI.

[76]  Francesco M. Donini,et al.  Complexity of Reasoning , 2003, Description Logic Handbook.

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

[78]  Franz Baader.  Computing the Least Common Subsumer in the Description Logic EL w.r.t. Terminological Cycles with Descriptive Semantics , 2003, ICCS.

[79]  Ian Horrocks,et al.  Implementation and Optimization Techniques , 2003, Description Logic Handbook.

[80]  Sebastian Brandt.  Implementing Matching in ALE--First Results , 2003, Description Logics.

[81]  Volker Haarslev,et al.  Description Logic Systems , 2003, Description Logic Handbook.

[82]  Yevgeny Kazakov,et al.  Subsumption of concepts in $DL$ ${\cal FL}_0$ for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete , 2003 .

[83]  Franz Baader,et al.  How Pervasive Is the Myerson-Satterthwaite Impossibility? , 2009, IJCAI.

[84]  Anni-Yasmin Turhan,et al.  Sonic - Non-standard Inferences Go OilEd , 2004, IJCAR.

[85]  Anni-Yasmin Turhan,et al.  Sonic: System Description , 2004, Description Logics.

[86]  Holger Knublauch,et al.  The Protégé OWL Plugin: An Open Development Environment for Semantic Web Applications , 2004, SEMWEB.

[87]  Franz Baader.  A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic EL , 2004, WG.

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

[89]  Bernhard Hollunder.  Consistency checking reduced to satisfiability of concepts in terminological systems , 2005, Annals of Mathematics and Artificial Intelligence.

[90]  Franz Baader,et al.  Computing the Least Common Subsumer w.r.t. a Background Terminology , 2004, Description Logics.

[91]  S. Brandt,et al.  Implementing Matching in ALN , 2022 .