A general datalog-based framework for tractable query answering over ontologies (extended abstract)

17th Italian Symposium on Advanced Database Systems, SEBD 2009

Volumn , Issue , 2009, Pages 29-36

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

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84893427457     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. J. Comput. Syst. Sci., 43(1):62-124, 1991.
2. H. Andŕeka, I. Ńemeti, and J. van Benthem. Modal languages and bounded fragments of predicate logic. J. Phil. Log., 27(3):217-274, 1998.
3. C. Beeri and M. Y. Vardi. The implication problem for data dependencies. In Proc. ICALP-1981, LNCS 115, pp. 73-85. Springer, 1981.
4. T. Berners-Lee, J. Hendler, and O. Lassila. The SemanticWeb. Sci. Amer., 284:34-43, 2001.
5. L. Cabibbo. The expressive power of stratified logic programs with value invention. Inf. Comput., 147(1):22-56, 1998.
6. A. Cal?, G. Gottlob, and M. Kifer. Taming the infinite chase: Query answering under expressive relational constraints. In Proc. KR-2008, pp. 70-80. AAAI Press, 2008. Revised version: http://benner.dbai.tuwien.ac.at/staff/ gottlob/CGK.pdf.
7. A. Cal?, G. Gottlob, and T. Lukasiewicz. A general Datalog-based framework for tractable query answering over ontologies. In Proc. PODS-2009. ACM Press, 2009 (in press).
8. A. Cal? and M. Kifer. Containment of conjunctive object meta-queries. In Proc. VLDB-2006, pp. 942-952, 2006.
9. A. Cal?, D. Lembo, and R. Rosati. On the decidability and complexity of query answering over inconsistent and incomplete databases. In Proc. PODS-2003, pp. 260-271, 2003.
10. F. Calimeri, S. Cozza, and G. Ianni. External sources of knowledge and value invention in logic programming. Ann. Math. Artif. Intell., 50(3/4):333-361, 2007.
11. 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.
12. A. Chandra and P. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proc. STOC-1977, pp. 77-90. ACM Press, 1977.
13. A. Deutsch, A. Nash, and J. B. Remmel. The chase revisited. In Proc. PODS-2008, pp. 149-158. ACM Press, 2008.
14. 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.
15. D. Johnson and A. Klug. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci., 28:167-189, 1984.
16. M. Lenzerini. Data integration: A theoretical perspective. In Proc. PODS-2002, pp. 233-246. ACM Press, 2002.
17. D. Maier, A. O. Mendelzon, and Y. Sagiv. Testing implications of data dependencies. ACM Trans. Database Syst., 4(4):455-469, 1979.
18. P. F. Patel-Schneider and I. Horrocks. Position paper: A comparison of two modelling paradigms in the Semantic Web. In Proc. WWW-2006, pp. 3-12. ACM Press, 2006.
19. 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.