Bridging the gap between OWL and relational databases

ABSTRACT

Schema statements in OWL are interpreted quite differently from analogous statements in relational databases. If these statements are meant to be interpreted as integrity constraints (ICs), OWL's interpretation may seem confusing and/or inappropriate. Therefore, we propose an extension of OWL with ICs that captures the intuition behind ICs in relational databases. We discuss the algorithms for checking IC satisfaction for different types of knowledge bases, and show that, if the constraints are satisfied, we can disregard them while answering a broad range of positive queries.

REFERENCES

• 1: Serge Abiteboul , Richard Hull , Victor Vianu, Foundations of Databases: The Logical Level, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1995
• 2: F. Baader, S. Brandt, and C. Lutz. Pushing the EL Envelope. In Proc. IJCAI 2005, pages 364--369, Edinburgh, UK, 2005.
• 3: Franz Baader , Diego Calvanese , Deborah L. McGuinness , Daniele Nardi , Peter F. Patel-Schneider, The description logic handbook: theory, implementation, and applications, Cambridge University Press, New York, NY, 2003
• 4: F. Baader and P. Hanschke. A Scheme for Integrating Concrete Domains into Concept Languages. In Proc. IJCAI '91, pages 452--457, Sydney, Australia, 1991.
• 5: F. Baader and U. Sattler. An Overview of Tableau Algorithms for Description Logics. Studia Logica, 69:5--40, 2001.
• 6: P. Bonatti, C. Lutz, and F. Wolter. Description Logics with Circumscription. In Proc. KR 2006, pages 400--410, Lake District, UK, 2006.
• 7: Alex Borgida, On the relative expressiveness of description logics and predicate logics, Artificial Intelligence, v.82 n.1-2, p.353-367, April 1996 [doi>10.1016/0004-3702(96)00004-5]
• 8: D. Calvanese, D. D. Giacomo, and M. Lenzerini. Keys for free in description logics. In Proc. DL 2000, Aachen, Germany, 2000.
• 9: D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Data Complexity of Query Answering in Description Logics. In Proc. KR 2006, pages 260--270, Lake District, UK, 2006.
• 10: Diego Calvanese , Giuseppe De Giacomo , Maurizio Lenzerini, On the decidability of query containment under constraints, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.149-158, June 01-04, 1998, Seattle, Washington, United States [doi>10.1145/275487.275504]
• 11: Francesco M. Donini , Daniele Nardi , Riccardo Rosati, Description logics of minimal knowledge and negation as failure, ACM Transactions on Computational Logic (TOCL), v.3 n.2, p.177-225, April 2002 [doi>10.1145/505372.505373]
• 12: B. Glimm, I. Horrocks, C. Lutz, and U. Sattler. Conjunctive Query Answering for the Description Logic SHIQ. In Proc. IJCAI 2007, India, 2007.
• 13: V. Haarslev and R. Möller. Incremental Query Answering for Implementing Document Retrieval Services. In Proc. DL 2003, Rome, Italy, 2003.
• 14: Stijn Heymans , Davy Nieuwenborgh , Dirk Vermeir, Conceptual logic programs, Annals of Mathematics and Artificial Intelligence, v.47 n.1-2, p.103-137, June 2006 [doi>10.1007/s10472-006-9030-5]
• 15: Alon Y. Levy, Obtaining Complete Answers from Incomplete Databases, Proceedings of the 22th International Conference on Very Large Data Bases, p.402-412, September 03-06, 1996
• 16: J. W. Lloyd and R. W. Topor. Making Prolog More Expressive. Journal of Logic Programming, 1(3):225--240, 1984.
• 17: C. Lutz, C. Areces, I. Horrocks, and U. Sattler. Keys, Nominals, and Concrete Domains. Journal of Artificial Intelligence Research, 23:667--726, 2005.
• 18: Carsten Lutz , Ulrike Sattler , Lidia Tendera, The complexity of finite model reasoning in description logics, Information and Computation, v.199 n.1-2, p.132-171, 25 May 2005 [doi>10.1016/j.ic.2004.11.002]
• 19: B. Motik, I. Horrocks, and U. Sattler. Integrating Description Logics and Relational Databases. Technical report, University of Manchester, UK, 2006.
• 20: B. Motik and R. Rosati. A Faithful Integration of Description Logics with Logic Programming. In Proc. IJCAI 2007, Hyderabad, India, 2007.
• 21: A. Nonnengart and C. Weidenbach. Computing Small Clause Normal Forms. In Handbook of Automated Reasoning, volume I, chapter 6, pages 335--367. Elsevier Science, 2001.
• 22: M. O. Rabin. Decidability of second--order theories and automata on infinite trees. Transations of the American Mathematical Society, 141:1--35, 1969.
• 23: Raymond Reiter, What should a database know?, Journal of Logic Programming, v.14 n.1-2, p.127-153, Oct., 1992 [doi>10.1016/0743-1066(92)90049-9]
• 24: R. Rosati. DL + log: A Tight Integration of Description Logics and Disjunctive Datalog. In Proc. KR 2006, pages 68--78, Lake District, UK, 2006.
• 25: S. Tobies. Complexity Results and Practical Algorithms for Logics in Knowledge Representation. PhD thesis, RWTH Aachen, Germany, 2001.

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.2 ARTIFICIAL INTELLIGENCE
      I.2.4 Knowledge Representation Formalisms and Methods

General Terms:
Languages, Theory

Keywords:
OWL, relational databases, semantic web