Keys, Nominals, and Concrete Domains

Many description logics (DLs) combine knowledge representation on an abstract, logical level with an interface to “concrete” domains like numbers and strings with built-in predicates such as <, +, and prefix-of. These hybrid DLs have turned out to be useful in several application areas, such as reasoning about conceptual database models. We propose to further extend such DLs with key constraints that allow the expression of statements like “US citizens are uniquely identified by their social security number”. Based on this idea, we introduce a number of natural description logics and perform a detailed analysis of their decidability and computational complexity. It turns out that naive extensions with key constraints easily lead to undecidability, whereas more careful extensions yield NExpTime-complete DLs for a variety of useful concrete domains.

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

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

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

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

[5]  Ian Horrocks,et al.  Reasoning in the SHOQ(D n ) Description Logic. , 2002 .

[6]  Frank van Harmelen,et al.  Web Ontology Language , 2004 .

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

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

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

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

[11]  Volker Haarslev,et al.  Foundations of Spatioterminological Reasoning with Description Logics , 1998, KR.

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

[13]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

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

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

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

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

[18]  Volker Haarslev,et al.  Practical Reasoning in RACER with a Concrete Domain for Linear Inequations , 2002, Description Logics.

[19]  Carsten Lutz,et al.  Reasoning about Entity Relationship Diagrams with Complex Attribute Dependencies , 2002, Description Logics.

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

[21]  Diego Calvanese,et al.  Keys for Free in Description Logics , 2000, Description Logics.

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

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

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

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

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

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

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

[29]  Carsten Lutz,et al.  PSpace Reasoning with the Description Logic ALCF(D) , 2002, Logic Journal of the IGPL.

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

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

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

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

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

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

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

[37]  Ian Horrocks.  Reasoning with Expressive Description Logics: Theory and Practice , 2002, CADE.

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

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

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

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

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

[43]  David Toman,et al.  On Reasoning about Structural Equality in XML: A Description Logic Approach , 2003, ICDT.

[44]  James A. Hendler,et al.  Web ontology language (OWL) reference version 1 , 2002 .

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

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