Bridging the gap between OWL and relational databases

16th International World Wide Web Conference, WWW2007

Volumn , Issue , 2007, Pages 807-816

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

^a UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

OWL; Relational databases; Semantic web

Indexed keywords

CONSTRAINT THEORY; KNOWLEDGE BASED SYSTEMS; ONTOLOGY; RELATIONAL DATABASE SYSTEMS;

INTEGRITY CONSTRAINTS; OWL; SCHEMA STATEMENTS;

SEMANTIC WEB;

EID: 35348840321     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1242572.1242681     Document Type: Conference Paper

References (25)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison Wesley, 1995.
2. F. Baader, S. Brandt, and C. Lutz. Pushing the εℒ Envelope. In Proc. IJCAI 2005, pages 364-369, Edinburgh, UK, 2005.
3. F. Baader, D. Calvanese, D. McGuinness, D. Nardi, and P. F. Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation and Applications. Cambridge University Press, 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. A. Borgida. On the Relative Expressiveness of Description Logics and Predicate Logics. Artificial Intelligence, 82(1-2):353-367, 1996.
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. D. Calvanese, G. D. Giacomo, and M. Lenzerini. On the Decidability of Query Containment under Constraints. In Proc. PODS '98, pages 149-158, Seattle, WA, USA, 1998.
11. F. M. Donini, D. Nardi, and R. Rosati. Description Logics of Minimal Knowledge and Negation as Failure. ACM 'Transactions on Computational Logic, 3(2):177-225, 2002.
12. B. Glimm, I. Horrocks, C. Lutz, and U. Sattler. Conjunctive Query Answering for the Description Logic script S sing script H sing script I sing script Q sing. 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. S. Heymans, D. V. Nieuwenborgh, and D. Vermeir. Conceptual Logic Programs. Annals of Mathematics and Artificial Intelligence, 2006. To appear.
15. A. Y. Levy. Obtaining Complete Answers from Incomplete Databases. In Proc. VLDB '96, pages 402-412, Mumbai, India, 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, Nominais, and Concrete Domains. Journal of Artificial Intelligence Research, 23:667-726, 2005.
18. C. Lutz, U. Sattler, and L. Tendera,. The Complexity of Finite Model Reasoning in Description Logics. Information and Computation, 199:132-171, 2005.
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 I1 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. R. Reiter. What Should a Database Know? Journal, of Logic Programming, 14(1-2):127-153, 1992.
24. B.. 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.