Datalog extensions for tractable query answering over ontologies

Semantic Web Information Management: A Model-Based Perspective

Volumn , Issue , 2010, Pages 249-279

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

^c VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79957840778     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-642-04329-1_12     Document Type: Chapter

References (38)

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