Bridging the gap between OWL and relational databases

Web Semantics

Volumn 7, Issue 2, 2009, Pages 74-89

  Motik, Boris ^a   Horrocks, Ian ^a   Sattler, Ulrike ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Integrity constraints; OWL; Relational databases; Semantic Web

Indexed keywords

COMPUTATIONAL PROBLEMS; DATA-CENTRIC; FIRST ORDERS; INTEGRITY CONSTRAINTS; KNOWLEDGE BASIS; OWL; RELATIONAL DATABASES; SCHEMA LANGUAGES; WEB ONTOLOGY LANGUAGES;

COMPUTATIONAL LINGUISTICS; INFORMATION THEORY; LINGUISTICS; MULTI AGENT SYSTEMS; ONTOLOGY; QUERY LANGUAGES; SEMANTIC WEB; SEMANTICS;

QUALITY ASSURANCE;

EID: 67349184996     PISSN: 15708268     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.websem.2009.02.001     Document Type: Article

References (43)

1. Abiteboul S., Hull R., and Vianu V. Foundations of Databases (1995), Addison Wesley
2. In: Baader F., Calvanese D., McGuinness D., Nardi D., and Patel-Schneider P.F. (Eds). The Description Logic Handbook: Theory, Implementation and Applications (January 2003), Cambridge University Press
3. Baader F., and Hanschke P. A scheme for integrating concrete domains into concept languages. In: Mylopoulos J., and Reiter R. (Eds). Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI'91). Sydney, Australia, August 24-30 (1991), Morgan Kaufmann Publishers 452-457
4. Baader F., and Sattler U. An overview of Tableau Algorithms for description logics. Studia Logica 69 (2001) 5-40
5. Bachmair L., and Ganzinger H. Resolution theorem proving. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning vol. I (2001), Elsevier Science 19-99 (Chapter 2)
6. Beneventano D., Bergamaschi S., and Sartori C. Description logics for semantic query optimization in object-oriented database systems. ACM Transactions on Database Systems 28 1 (2003) 1-50
7. Bonatti P., Lutz C., and Wolter F. Description logics with circumscription. In: Doherty P., Mylopoulos J., and Welty C.A. (Eds). Proc. of the 10th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2006). Lake District, UK, June 2-5 (2006), AAAI Press 400-410
8. Borgida A. On the relative expressiveness of description logics and predicate logics. Artificial Intelligence 82 1-2 (1996) 353-367
9. Borgida A., Brachman R.J., McGuinness D.L., and Resnick L.A. CLASSIC: a structural data model for objects. ACM SIGMOD Record 18 2 (1989) 58-67
10. Brachman R.J., and Schmolze J.G. An overview of the KL-ONE knowledge representation system. Cognitive Science 9 2 (1985) 171-216
11. D. Calvanese, D. De Giacomo, M. Lenzerini, Keys for free in description logics, in: F., Baader, U., Sattler (Eds.), Proc. of the 2000 Int. Workshop on Description Logic (DL 2000), volume 81 of CEUR Workshop Proceedings, Aachen, Germany, August 17-19, 2000.
12. Calvanese D., De Giacomo G., and Lenzerini M. On the decidability of query containment under constraints. Proc. of the 17th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems (PODS'98). Seattle, WA, USA, June 1-3 (1998), ACM Press 149-158
13. Chakravarthy U.S., Grant J., and Minker J. Logic-based approach to semantic query optimization. ACM Transactions on Database Systems 15 2 (1990) 162-207
14. Clark K. Negation as failure. In: Gallaire H., Minker J., and Nicolas J. (Eds). Logic and Databases (1978), Plenum Press
15. de Bruijn J., Polleres A., Lara R., and Fensel D. OWL DL vs. OWL Flight: conceptual modeling and reasoning on the Semantic Web. Proc. of the 14th Int. World Wide Web Conference (WWW2005). Chiba, Japan, May 10-14 (2005), ACM 623-632
16. Donini F.M., Nardi D., and Rosati R. Description logics of minimal knowledge and negation as failure. ACM Transactions on Computational Logic 3 2 (2002) 177-225
17. Eiter T., Gottlob G., and Mannila H. Disjunctive datalog. ACM Transactions on Database Systems 22 3 (1997) 364-418
18. Glimm B., Horrocks I., Lutz C., and Sattler U. Conjunctive query answering for the description logic S H I Q. Proc. of the 20th Int. Joint Conf. on Artificial Intelligence (IJCAI 2007). India, January 6-12 (2007), Morgan Kaufmann Publishers 399-405
19. V. Haarslev, R. Möller, Incremental query answering for implementing document retrieval services, in: D., Calvanese, G., de Giacomo, F., Franconi (Eds.), Proc. of the 2003 Int. Workshop on Description Logics (DL 2003), volume 81 of CEUR Workshop Proceedings, Rome, Italy, September 5-7, 2003.
20. Heymans S., Van Nieuwenborgh D., and Vermeir D. Conceptual logic programs. Annals of Mathematics and Artificial Intelligence 47 1-2 (2006) 103-137
21. Imieliński T., and Lipski W. Incomplete information in relational databases. Jounal of the ACM 31 4 (1984) 761-791
22. Jeusfeld M.A., and Staudt M. Query optimization in deductive object bases. In: Freytag J.C., Vossen D., and Maier G. (Eds). Query Processing for Advanced Database Systems (August 1993), Morgan Kaufmann publishers 145-176
23. Kifer M., Lausen G., and Wu J. Logical foundations of object-oriented and frame-based languages. Journal of the ACM 42 4 (1995) 741-843
24. Kowalski R.A. Logic for data description. In: Gallaire H., and Minker J. (Eds). Logic and Data Bases (1977), Plemum Press 77-103
25. Levy A.Y. Obtaining complete answers from incomplete databases. In: Vijayaraman T.M., Buchmann A.P., Mohan C., and Sarda N.L. (Eds). Proc. of 22th Int. Conf. on Very Large Data Bases (VLDB'96). Mumbai, India, September 3-6 (1996), Morgan Kaufmann 402-412
26. Lifschitz V. Minimal belief and negation as failure. Artificial Intelligence 70 1-2 (1994) 53-72
27. Lloyd I.W., and Topor R.W. A basis for deductive database systems. Journal of Logic Programming 30 1 (1986) 55-67
28. Lloyd J.W., and Topor R.W. Making prolog more expressive. Journal of Logic Programming 1 3 (1984) 225-240
29. Lutz C., Areces C., Horrocks I., and Sattler U. Keys, nominals, and concrete domains. Journal of Artificial Intelligence Research 23 (2005) 667-726
30. Lutz C., Sattler U., and Tendera L. The complexity of finite model reasoning in description logics. Information and Computation 199 (2005) 132-171
31. Motik B., Horrocks I., and Sattler U. Bridging the gap between OWL and relational databases. Proc. of the 16th International World Wide Web Conference (WWW 2007). Banff, AB, Canada, May 8-12 (2007), ACM Press 807-816
32. Motik B., and Rosati R. A faithful integration of description logics with logic programming. Proc. of the 20th Int. Joint Conf. on Artificial Intelligence (IJCAI 2007). Hyderabad, India, January 6-12 (2007), Morgan Kaufmann Publishers 477-482
33. Mylopoulos J., Borgida A., Jarke M., and Koubarakis M. Telos: representing knowledge about information systems. ACM Transactions of Information Systems 8 4 (1990) 325-362
34. Nonnengart A., and Weidenbach C. Computing small clause normal forms. In: Robinson A., and Voronkov A. (Eds). Handbook of Automated Reasoning vol. I (2001), Elsevier Science 335-367 (Chapter 6)
35. Pratt-Hartmann I. Complexity of the guarded two-variable fragment with counting quantifiers. Journal of Logic and Computation 17 1 (2007) 133-155
36. Rabin M.O. Decidability of second-order theories and automata on infinite trees. Transations of the American Mathematical Society 141 (1969) 1-35
37. R. Reiter, Towards a logical reconstruction of relational database theory, in: M.L., Brodie, J., Mylopulos, J.W., Schmidt (Eds.), On Conceptual Modelling: Perspectives from Artificial Intelligence, Databases and Programming Languages, 1982, pp. 191-233.
38. Reiter R. What should a database know?. Journal of Logic Programming 14 1-2 (1992) 127-153
39. Rosati R. D L + log : a tight integration of description logics and disjunctive datalog. In: Doherty P., Mylopoulos J., and Welty C.A. (Eds). Proc. of the 10th Int. Conf. on the Principles of Knowledge Representation and Reasoning (KR 2006). Lake District, UK, June 2-5 (2006), AAAI Press 68-78
40. Sadri F., and Kowalski R. A theorem-proving approach to database integrity. In: Minker J. (Ed). Foundations of Deductive Databases and Logic Programming (1988), Morgan Kaufmann Publishers 313-362
41. Staudt M., and Jarke M. Incremental maintenance of externally materialized views. In: Vijayaraman T.M., Buchmann A.P., Mohan C., and Sarda N.L. (Eds). Proc. of the 22th Int. Conf. on Very Large Data Bses (VLDB'96). Mumbai, India, September 3-6 (1996), Morgan Kaufmann 75-86
42. S. Tobies, Complexity results and practical algorithms for logics in knowledge representation, PhD Thesis, RWTH Aachen, Germany, 2001.
43. van der Meyden R. Logical approaches to incomplete information. In: Chomicki J., and Saake G. (Eds). Logics for Databases and Information Systems (1998), Kluwer Academic Publisher 307-356