Integrating Description Logics and Relational Databases

In this paper, we compare description logics with relational databases with respect to their treatment of schema constraints, the languages used to express these constraints, and the approaches to query answering and constraint checking. Our analysis reveals a significant overlap between the two formalisms. Inspired by the integrity constraints of relational databases, we define a notion of integrity constraints for description logics. We analyze different possibilities for defining the semantics of the constraints. Finally, we present several algorithms for checking constraint satisfaction for description logics with varying degrees of expressivity.

[1]  Ian Horrocks,et al.  Keys, Nominals, and Concrete Domains , 2003, IJCAI.

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

[3]  Ilkka Niemelä,et al.  The Smodels System , 2001, LPNMR.

[4]  Wolfgang Faber,et al.  Declarative problem-solving using the DLV system , 2000 .

[5]  Alon Y. Halevy,et al.  Obtaining Complete Answers from Incomplete Databases , 1996, VLDB.

[6]  Ian Horrocks,et al.  The Even More Irresistible SROIQ , 2006, KR.

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

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

[9]  Georg Gottlob,et al.  Complexity and expressive power of logic programming , 2001, CSUR.

[10]  Ian Horrocks,et al.  Conjunctive Query Answering for the Description Logic SHIQ , 2007, IJCAI.

[11]  Volker Haarslev,et al.  Incremental Query Answering for Implementing Document Retrieval Services , 2003, Description Logics.

[12]  Oded Shmueli,et al.  Equivalence of DATALOG Queries is Undecidable , 1993, J. Log. Program..

[13]  Riccardo Rosati,et al.  DL+log: Tight Integration of Description Logics and Disjunctive Datalog , 2006, KR.

[14]  Franz Baader,et al.  From Tableaux to Automata for Description Logics , 2003, Fundam. Informaticae.

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

[16]  Ilkka Niemelä,et al.  A Tableau Calculus for Minimal Model Reasoning , 1996, TABLEAUX.

[17]  Boris Motik,et al.  Data Complexity of Reasoning in Very Expressive Description Logics , 2005, IJCAI.

[18]  Thomas Wilke,et al.  Automata logics, and infinite games: a guide to current research , 2002 .

[19]  Francesco M. Donini,et al.  Description logics of minimal knowledge and negation as failure , 2002, TOCL.

[20]  Boris Motik,et al.  A Faithful Integration of Description Logics with Logic Programming , 2007, IJCAI.

[21]  David A. Plaisted,et al.  A Structure-Preserving Clause Form Translation , 1986, J. Symb. Comput..

[22]  Raymond Reiter,et al.  What should a database know? , 1988, PODS '88.

[23]  Mark Weyer.  Decidability of S1S and S2S , 2001, Automata, Logics, and Infinite Games.

[24]  Harald Ganzinger,et al.  Resolution Theorem Proving , 2001, Handbook of Automated Reasoning.

[25]  M. Rabin.  Decidability of second-order theories and automata on infinite trees , 1968 .

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

[27]  Alexander Borgida,et al.  Loading data into description reasoners , 1993, SIGMOD Conference.

[28]  Ian Horrocks,et al.  How to Decide Query Containment Under Constraints Using a Description Logic , 2000, LPAR.

[29]  Stijn Heymans,et al.  Conceptual logic programs , 2006, Annals of Mathematics and Artificial Intelligence.

[30]  Alex Borgiday.  On the Relative Expressiveness of Description Logics and Predicate Logics , 1996 .

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

[32]  Diego Calvanese,et al.  Data Complexity of Query Answering in Description Logics , 2006, Description Logics.

[33]  Vladimir Lifschitz.  Minimal Belief and Negation as Failure , 1994, Artif. Intell..

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

[35]  Christoph Weidenbach,et al.  Computing Small Clause Normal Forms , 2001, Handbook of Automated Reasoning.

[36]  Ian Horrocks,et al.  Querying the Semantic Web: A Formal Approach , 2002, SEMWEB.

[37]  Carsten Lutz,et al.  Description Logics with Circumscription , 2006, KR.