Description logics: foundations for class-based knowledge representation

Class-based languages express knowledge in terms of objects and classes, and have inspired a huge number of formalisms in computer science. Description logics forma family of both class-based and logic-based knowledge representation languages which allow for modeling an application domain in terms of objects, classes and relationships between classes, and for reasoning about them. This paper presents an overview of the research carried out in the last years in description logics, with the main goal of illustrating how these logics provide the foundations for class-based knowledge representation formalisms.

[1]  Maurizio Vincini,et al.  ODB-QOPTIMIZER: a tool for semantic query optimization in OODB , 1997, Proceedings 13th International Conference on Data Engineering.

[2]  Franz Baader,et al.  Fusions of Description Logics , 2000, Description Logics.

[3]  Diego Calvanese,et al.  Making object-oriented schemas more expressive , 1994, PODS '94.

[4]  Peter Buneman,et al.  Semistructured data , 1997, PODS.

[5]  E. Muller David,et al.  Alternating automata on infinite trees , 1987 .

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

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

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

[9]  Maurizio Lenzerini,et al.  What's in an Aggregate: Foundations for Description Logics with Tuples and Sets , 1995, IJCAI.

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

[11]  Vaughan R. Pratt,et al.  A Near-Optimal Method for Reasoning about Action , 1980, J. Comput. Syst. Sci..

[12]  P. Patel-Schneider.  Small can be beautiful in knowledge representation , 1984 .

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

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

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

[16]  Maurizio Lenzerini,et al.  A Uniform Framework for Concept Definitions in Description Logics , 1997, J. Artif. Intell. Res..

[17]  E. Allen Emerson,et al.  Tree automata, mu-calculus and determinacy , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[18]  David Toman,et al.  On Decidability and Complexity of Description Logics with Uniqueness Constraints , 2001, Description Logics.

[19]  Maurizio Lenzerini,et al.  Concept Languages as Query Languages , 1991, AAAI.

[20]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[21]  Silvana Castano,et al.  Semantic integration of heterogeneous information sources , 2001, Data Knowl. Eng..

[22]  Ivar Jacobson,et al.  The unified modeling language reference manual , 2010 .

[23]  Stephan Tobies,et al.  The Complexity of Reasoning with Cardinality Restrictions and Nominals in Expressive Description Logics , 2011, ArXiv.

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

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

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

[27]  Diego Calvanese,et al.  2ATAs make DLs easy , 2002, Description Logics.

[28]  Maurizio Lenzerini,et al.  Description Logics with Inverse Roles, Functional Restrictions, and N-ary Relations , 1994, JELIA.

[29]  Alexander Borgida,et al.  Adding Uniqueness Constraints to Description Logics (Preliminary Report) , 1997, DOOD.

[30]  M. de Rijke,et al.  Expressiveness of Concept Expressions in First-Order Description Logics , 1999, Artif. Intell..

[31]  Diego Calvanese,et al.  What can Knowledge Representation do for Semi-Structured Data? , 1998, AAAI/IAAI.

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

[33]  Jeffrey D. Ullman,et al.  Information integration using logical views , 1997, Theor. Comput. Sci..

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

[35]  Patrick Blackburn,et al.  Nominal Tense Logic , 1992, Notre Dame J. Formal Log..

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

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

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

[39]  Bart De Moor,et al.  Implementation and Applications , 1996 .

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

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

[42]  Diego Calvanese,et al.  Description Logic Framework for Information Integration , 1998, KR.

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

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

[45]  Franz Baader,et al.  Embedding defaults into terminological knowledge representation formalisms , 1995, Journal of Automated Reasoning.

[46]  Werner Nutt,et al.  An Epistemic Operator for Description Logics , 1998, Artif. Intell..

[47]  Premkumar Devanbu,et al.  The use of description logics in KBSE systems , 1994, Proceedings of 16th International Conference on Software Engineering.

[48]  Diego Calvanese,et al.  Identification Constraints and Functional Dependencies in Description Logics , 2001, IJCAI.

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

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

[51]  Arantza Illarramendi,et al.  Building a Federated Relational Database System: An Approach Using a Knowledge-Based System , 1994, Int. J. Cooperative Inf. Syst..

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

[53]  François Goasdoué,et al.  The Use of CARIN Language and Algorithms for Information Integration: The PICSEL System , 2000, Int. J. Cooperative Inf. Syst..

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

[55]  Wiebe van der Hoek.  On the Semantics of Graded Modalities , 1992, J. Appl. Non Class. Logics.

[56]  Amit P. Sheth,et al.  On Automatic Reasoning for Schema Integration , 1993, Int. J. Cooperative Inf. Syst..

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

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

[59]  Diego Calvanese,et al.  Finite Model Reasoning in Description Logics , 1996, KR.

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

[61]  Dieter Pfoser.  Indexing the Trajectories of Moving Objects , 2002 .

[62]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Branching-Time Model Checking (Extended Abstract) , 1994, CAV.

[63]  Francesco M. Donini,et al.  AL-log: Integrating Datalog and Description Logics , 1998, Journal of Intelligent Information Systems.

[64]  Diane J. Litman,et al.  Terminological Reasoning with Constraint Networks and an Application to Plan Recognition , 1992, KR.

[65]  Tinko Tinchev,et al.  PDL with Data Constants , 1985, Inf. Process. Lett..

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

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

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

[69]  George Gargov,et al.  Determinism and Looping in Combinatory PDL , 1988, Theor. Comput. Sci..

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

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

[72]  Catriel Beeri,et al.  Rewriting queries using views in description logics , 1997, PODS '97.

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

[74]  David E. Muller,et al.  Alternating Automata on Infinite Trees , 1987, Theor. Comput. Sci..

[75]  Enrico Franconi,et al.  A Computational Account for a Description Logic of Time and Action , 1994, KR.

[76]  F. Baader,et al.  Concept Logics , 1990 .

[77]  Maurizio Lenzerini,et al.  Representing and Using Interschema Knowledge in Cooperative Information Systems , 1993, Int. J. Cooperative Inf. Syst..

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

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

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

[81]  Francesco M. Donini,et al.  Reasoning in description logics , 1997 .

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

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

[84]  Joann J. Ordille,et al.  Query-Answering Algorithms for Information Agents , 1996, AAAI/IAAI, Vol. 1.

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

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

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

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

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

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

[91]  Diego Calvanese,et al.  Dwq : Esprit Long Term Research Project, No 22469 on the Decidability of Query Containment under Constraints on the Decidability of Query Containment under Constraints , 2022 .

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

[93]  Maarten Marx,et al.  Hybrid logics: characterization, interpolation and complexity , 2001, Journal of Symbolic Logic.

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

[95]  Giuseppe De Giacomo,et al.  Combining Deduction and Model Checking into Tableaux and Algorithms for Converse-PDL , 2000, Inf. Comput..

[96]  Sonia Bergamaschi,et al.  On taxonomic reasoning in conceptual design , 1992, TODS.

[97]  Edith Hemaspaandra,et al.  A modal perspective on the computational complexity of attribute value grammar , 1993, J. Log. Lang. Inf..

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

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

[100]  Alexander Borgida,et al.  Description Logics in Data Management , 1995, IEEE Trans. Knowl. Data Eng..

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

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

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

[104]  Maurizio Fattorosi-Barnaba,et al.  Graded modalities. I , 1985, Stud Logica.

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

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

[107]  Tinko Tinchev,et al.  An Essay in Combinatory Dynamic Logic , 1991, Inf. Comput..

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

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

[110]  Erich Grädel,et al.  Decidability issues for action guarded logics , 2000, Description Logics.

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

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

[113]  Diego Calvanese,et al.  Unifying Class-Based Representation Formalisms , 2011, J. Artif. Intell. Res..

[114]  Alon Y. Halevy,et al.  Combining Horn Rules and Description Logics in CARIN , 1998, Artif. Intell..

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

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

[117]  Valentin Goranko,et al.  Modal logic with names , 1993, J. Philos. Log..

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

[119]  Diego Calvanese,et al.  Representing and Reasoning on XML Documents: A Description Logic Approach , 1999, J. Log. Comput..

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