Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues

Theory and Practice of Logic Programming

Volumn 12, Issue 4-5, 2012, Pages 701-718

  Alviano, Mario ^a   Faber, Wolfgang ^a   Leone, Nicola ^a   Manna, Marco ^a  

^a UNIVERSITY OF CALABRIA   (Italy)

Author keywords

complexity; datalog; decidability; non monotonic reasoning

Indexed keywords

DATA INTEGRATION; KNOWLEDGE REPRESENTATION; LOGIC PROGRAMMING; ONTOLOGY;

COMPLEXITY; CONSISTENT QUERY ANSWERING; DATALOG; EXISTENTIAL QUANTIFICATIONS; KNOWLEDGE REPRESENTATION AND REASONING; NON-MONOTONIC REASONING; ONTOLOGY-BASED DATA ACCESS; SEMANTIC WEB APPLICATIONS;

COMPUTABILITY AND DECIDABILITY;

EID: 84864974336     PISSN: 14710684     EISSN: 14753081     Source Type: Journal    
DOI: 10.1017/S1471068412000257     Document Type: Article

References (28)

1. Andr'eka, H., N'emeti, I. and Van Benthem, J. 1998.Modal languages and bounded fragments of predicate logic. Journal of Philosophical Logic 27, 217-274.
2. Barany, V., Gottlob, G. and Otto, M. 2010. Querying the guarded fragment. In Proceedings of the 25th Annual IEEE Symposium on LICS. 1-10.
3. Cal̀i, A., Gottlob, G. and Kifer, M. 2008. Taming the infinite chase: Query answering under expressive relational constraints. In Proceedings of the 11th KR International Conference. 70-80. Revised version: Http://dbai.tuwien.ac.at/staff/gottlob/CGK.pdf
4. Cal̀i, A., Gottlob, G. and Lukasiewicz, T. 2009. A general datalog-based framework for tractable query answering over ontologies. In Proceedings of the 28th PODS Symposium. 77-86.
5. Cal̀i, A., Gottlob, G. and Pieris, A. 2010a. Advanced processing for ontological queries. PVLDB 3, 1, 554-565.
6. Cal̀i, A., Gottlob, G. and Pieris, A. 2010b. Query answering under non-guarded rules in Datalog. In Proceedings of the 4th RR International Conferences, vol. 6333. 1-17.
7. Cal̀i, A., Gottlob, G. and Pieris, A. 2011. New expressive languages for ontological query answering. In Proceedings of the 25th AAAI Conference on AI. 1541-1546.
8. Calvanese, D., De Giacomo, G., Lembo, D., Lenzerini, M., Poggi, A., Rodriguez-Muro, M. and Rosati, R. 2009. Ontologies and databases: The DL-Lite approach. In Reasoning Web. LNCS, vol. 5689. Springer, 255-356.
9. Calvanese, D., Giacomo, G., Lembo, D., Lenzerini, M. and Rosati, R. 2007. Tractable reasoning and efficient query answering in description logics: The DL-Lite family. Journal of Automatic Reasoning 39, 385-429. (Pubitemid 47340922)
10. Chekuri, C. and Rajaraman, A. 2000. Conjunctive query containment revisited. Theoretical Computer Science 239, 2, 211-229.
11. De Moor, O., Gottlob, G., Furche, T. and Sellers, A., Eds. 2011. Datalog Reloaded. First International Workshop, Datalog 2010. Revised Selected Papers. LNCS, vol. 6702. Springer Verlag
12. Deutsch, A., Nash, A. and Remmel, J. 2008. The chase revisited. In Proceedings of the 27th PODS Symposium 149-158.
13. Eiter, T., Faber, W., Leone, N., Pfeifer, G. and Polleres, A. 2004. A logic programming approach to knowledge-state planning: Semantics and complexity. ACM TOCL 5, 2, 206-263.
14. Eiter, T., Gottlob, G. and Mannila, H. 1997. Disjunctive datalog. ACM TODS 22, 3, 364-418. (Pubitemid 127483103)
15. Fagin, R., Kolaitis, P. G., Miller, R. J. and Popa, L. 2005. Data exchange: Semantics and query answering. TCS 336, 1, 89-124. (Pubitemid 40612385)
16. Ferraris, P., Lee, J. and Lifschitz, V. 2011. Stable models and circumscription. Artificial Intelligence 175, 1, 236-263.
17. Gottlob, G., Leone, N. and Scarcello, F. 1999. Hypertree decompositions and tractable queries. In Proceedings of the 18th PODS Symp. 21-32.
18. Gr̈adel, E. 1999. On the restraining power of guards. The Journal of Symbolic Logic 64, 4, 1719-1742.
19. Greco, S., Spezzano, F. and Trubitsyna, I. 2011. Stratification criteria and rewriting techniques for checking chase termination. PVLDB 4, 11, 1158-1168.
20. Hustadt, U., Motik, B. and Sattler, U. 2004. Reducing SHIQ- Descrption logic to disjunctive datalog programs. In Proceedings of the 9th KR International Conference. 152-162.
21. Johnson, D. and Klug, A. 1984. Testing containment of conjunctive queries under functional and inclusion dependencies. Journal of Computer and System Sciences 28, 1, 167-189. (Pubitemid 14569352)
22. Kollia, I., Glimm, B. and Horrocks, I. 2011. SPARQL query answering over OWL ontologies. In Proceedings of the 24th DL International Workshop. LNCS, vol. 6643. Springer, 382-396.
23. Leone, N., Gottlob, G., Rosati, R., Eiter, T., Faber, W., Fink, M., Greco, G., Ianni, G., Ka-lka, E., Lembo, D., Lenzerini, M., Lio, V., Nowicki, B., Ruzzi, M., Staniszkis, W. and Terracina, G. 2005. The INFOMIX system for advanced integration of incomplete and inconsistent data. In Proceedings of the 24th ACM SIGMOD International Conference on Management of Data. 915-917. (Pubitemid 43039008)
24. Leone, N., Manna, M., Terracina, G. and Veltri, P. 2012. Efficiently computable datalog∃ programs. In Proceedings of the 13th KR International Conference, Forthcoming. Long version: Www.mat.unical.it/kr2012/shy.pdf
25. Maier, D., Mendelzon, A. O. and Sagiv, Y. 1979. Testing implications of data dependencies. ACM TODS 4, 4, 455-469.
26. Marnette, B. 2009. Generalized schema-Mappings: From termination to tractability. In Proceedings of the 28th PODS Symposium. 13-22.
27. Meier, M., Schmidt, M. and Lausen, G. 2009. On chase termination beyond stratification. PVLDB 2, 1, 970-981.
28. Mugnier, M.-L. 2011. Ontological query answering with existential rules. In Proceedings of the 5th RR International Conference. 2-23.