Datalog±: A unified approach to ontologies and integrity constraints

ACM International Conference Proceeding Series

Volumn 361, Issue , 2009, Pages 14-30

  Calì, Andrea ^a,b   Gottlob, Georg ^a,b   Lukasiewicz, Thomas ^a,c  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Chase; Complexity; Conjunctive queries; Constraints; Datalog; Dependencies; Ontologies; Query evaluation; Semantic web; Tractability

Indexed keywords

CHASE; COMPLEXITY; CONJUNCTIVE QUERIES; CONSTRAINTS; DATALOG; DEPENDENCIES; QUERY EVALUATION; TRACTABILITY;

COMPUTABILITY AND DECIDABILITY; DATA DESCRIPTION; DATA HANDLING; LINGUISTICS; QUERY LANGUAGES; SEMANTIC WEB; SEMANTICS;

ONTOLOGY;

EID: 70349108780     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1514894.1514897     Document Type: Conference Paper

References (39)

1. S. Abiteboul, R. Hull, and V. Vianu. Foundations of Databases. Addison-Wesley, 1995.
2. H. Andréka, I. Németi, and J. van Benthem. Modal languages and bounded fragments of predicate logic. J. Philos. Logic, 27(3):217-274, 1998.
3. K. Apt, H. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 89-148. Morgan Kaufmann, 1988.
4. C. Beeri, R. Fagin, D. Maier, A. O. Mendelzon, J. D. Ullman, and M. Yannakakis. Properties of acyclic database schemes. In Proc, of STOC 1981, pages 355-362. ACM Press, 1981.
5. C. Beeri and M. Y. Vardi. The implication problem for data dependencies. In Proc, of ICALP 1981, volume 115 of LNCS, pages 73-85. Springer, 1981.
6. C. Beeri and M. Y. Vardi. A proof procedure for data dependencies. J. ACM, 31(4):718-741, 1984.
7. T. Berners-Lee, J. Hendler, and O. Lassila. The Semantic Web. Scientific American, 284:34-43, 2001.
8. D. Brickley and R. V. Guha. RDF vocabulary description language 1.0: RDF Schema, 2004. W3C Recommendation.
9. A. Calì, G. Gottlob, and M. Kifer. Taming the infinite chase: Query answering under expressive relational constraints. Unpublished technical report, 2008. Available from the authors or at http://benner.dbai.tuwien.ac.at/ staff/gottlob/CGK.pdf. This is the full and revised version of a preliminary short version which has appeared in Proc. of KR 2008, pages 70-80. AAAI Press, 2008.
10. A. Calì, G. Gottlob, and T. Lukasiewicz. A general Datalog-based framework for tractable query answering over ontologies. In Proc. of PODS 2009. ACM Press, 2009. To appear.
11. A. Call and M. Kifer. Containment of conjunctive object meta-queries. In Proc, of VLDB 2006, pages 942-952. ACM Press, 2006.
12. A. Call, D. Lembo, and R. Rosati. On the decidability and complexity of query answering over inconsistent and incomplete databases. In Proc, of PODS 2003, pages 260-271. ACM Press, 2003.
13. D. Calvanese, G. De Giacomo, D. Lembo, M. Lenzerini, and R. Rosati. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. J. Autom. Reasoning, 39(3):385-429, 2007.
14. M. A. Casanova, R. Fagin, and C. H. Papadimitriou. Inclusion dependencies and their interaction with functional dependencies. Journal of Computer and System Sciences, 28:29-59, 1984.
15. S. Ceri, G. Gottlob, and L. Tanca. Logic Programming and Databases. Springer, New York, NY, 1990.
16. A. K. Chandra, H. R. Lewis, and J. A. Makowsky. Embedded implicational dependencies and their inference problem. In Proc, of STOC 1981, pages 342-354. ACM Press, 1981.
17. A. K. Chandra and P. M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proc, of STOC 1977, pages 77-90. ACM Press, 1977.
18. A. K. Chandra and M. Y. Vardi. The implication problem for functional and inclusion dependencies is undecidable. SIAM J. Comput., 14:671-677, 1985.
19. B. Courcelle. The monadic second-order logic of graphs. I. recognizable sets of finite graphs. Information and Computation, 85(1):12-75, 1990.
20. J. de Bruijn and S. Heymans. Logical foundations of (e)RDF(S): Complexity and reasoning. In Proc, of ISWC 2007, volume 4825 of LNCS, pages 86-99. Springer, 2007.
21. A. Deutsch, A. Nash, and J. B. Remmel. The chase revisited. In Proc, of PODS 2008, pages 149-158. ACM Press, 2008.
22. A. Deutsch and V. Tannen. Reformulation of XML queries and constraints. In Proc, of ICDT 2003, volume 2572 of LNCS, pages 225-241. Springer, 2003.
23. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa. Data exchange: Semantics and query answering. Theor. Comput. Sci., 336(1):89-124, 2005.
24. M. E. Goncalves and E. Grädel. Decidability issues for action guarded logics. In Proc, of DL 2000, pages 123-132, 2000.
25. G. Gottlob, C. Koch, R. Baumgartner, M. Herzog, and S. Flesca. The Lixto data extraction project - back and forth between theory and practice. In Proc, of PODS 2004, pages 1-12. ACM Press, 2004.
26. G. Gottlob and C. H. Papadimitriou. On the complexity of single-rule Datalog queries. Inf. Comput, 183(1):104-122, 2003.
27. E. Grädel. On the restraining power of guards. J. Symb. Log., 64(4):1719-1742, 1999.
28. U. Hustadt, B. Motik, and U. Sattler. Data complexity of reasoning in very expressive description logics. In Proc, of IJCAI 2005, pages 466-471, 2005.
29. D. S. Johnson and A. C. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci., 28(1):167-189, 1984.
30. M. Kifer, G. Lausen, and J. Wu. Logical foundations of object-oriented and frame-based languages. J. ACM, 42:741-843, 1995.
31. M. Lenzerini. Data integration: A theoretical perspective. In Proc, of PODS 2002, pages 233-246. ACM Press, 2002.
32. D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM Trans. Database Syst., 4(4):455-469, 1979.
33. J. Mitchell. The implication problem for functional and inclusion dependencies. Information and Control, 56:154-173, 1983.
34. P. F. Patel-Schneider and I. Horrocks. Position paper: A comparison of two modelling paradigms in the Semantic Web. In Proc, of WWW 2006, pages 3-12. ACM Press, 2006.
35. A. Poggi, D. Lembo, D. Calvanese, G. De Giacomo, M. Lenzerini, and R. Rosati. Linking data to ontologies. J. Data Semantics, 10:133-173, 2008.
36. X. Qian. Query folding. In Proc, of ICDE 1996, pages 48-55. IEEE, 1996.
37. J. D. Ullman. Principles of Database and Knowledge Base Systems. CS Press, Rockville, MD, 1989.
38. M. Y. Vardi, 1984. Personal communication reported in [29].
39. M. Y. Vardi. On the complexity of bounded-variable queries. In Proc, of PODS 1995, pages 266-176. ACM Press, 1995.