Rewriting ontological queries into small nonrecursive datalog programs

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2012, Pages 254-263

  Gottlob, Georg ^a   Schwentick, Thomas ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE REPRESENTATION; ONTOLOGY; QUERY PROCESSING;

CONJUNCTIVE QUERIES; DATALOG; DL-LITE; NON-RECURSIVE DATALOG; ONTOLOGICAL DATABASE; ONTOLOGICAL QUERY; RELATIONAL DATABASE;

INTELLIGENT DATABASES;

EID: 84893348866     PISSN: 23341025     EISSN: 23341033     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. Acciarri, A.; Calvanese, D.; Giacomo, G D.; Lembo, D.; Lenzerini, M.; Palmieri, M.; and Rosati, R. 2005. QuOnto: Querying ontologies. In Proc. of AAAI, 1670-1671.
2. Artale, A.; Calvanese, D.; Kontchakov, R.; and Zakharyaschev, M. 2009. The dl-lite family and relations. J. Artif. Intell. Res. (JAIR) 36:1-69.
3. Beeri, C., and Vardi, M. Y. 1981. The implication problem for data dependencies. In Proc. of ICALP, 73-85.
4. Calì, A.; Gottlob, G.; Lukasiewicz, T.; Marnette, B.; and Pieris, A. 2010. Datalog+/-: A family of logical knowledge representation and query languages for new applications. In LICS, 228-242. IEEE Computer Society.
5. Calì, A.; Gottlob, G.; and Kifer, M. 2008. Taming the infinite chase: Query answering under expressive relational constraints. In Proc. of KR, 70-80.
6. Calì, A.; Gottlob, G.; and Lukasiewicz, T. 2009. A general datalog-based framework for tractable query answering over ontologies. In Proc. of PODS, 77-86. Full version to appear in Journal of Web Semantics; currently available at http://dl.dropbox.com/u/472264/jws.pdf.
7. Calì, A.; Gottlob, G.; and Pieris, A. 2010a. Query rewriting under non-guarded rules. In Proc. AMW.
8. Calì, A.; Gottlob, G.; and Pieris, A. 2010b. Advanced processing for ontological queries. PVLDB 3(1):554-565.
9. Calì, A.; Gottlob, G.; and Pieris, A. 2010c. Query answering under non-guarded rules in datalog+/-. In Proc. of RR, 175-190.
10. Calì, A.; Gottlob, G.; and Pieris, A. 2011. Towards more expressive ontology languages: The query answering problem. Technical report, University of Oxford, Department of Computer Science. Submitted for publication - currently available at http://dl.dropbox.com/u/3185659/CGP.pdf.
11. Calvanese, D.; De Giacomo, G.; Lembo, D.; Lenzerini, M.; and Rosati, R. 2007. Tractable reasoning and efficient query answering in description logics: The DL-lite family. J. Au-tom. Reasoning 39(3):385-429.
12. Calvanese, D.; Giacomo, G. D.; Lembo, D.; Lenzerini, M.; Poggi, A.; Rodriguez-Muro, M.; Rosati, R.; Ruzzi, M.; and Savo, D. F. 2011. The mastro system for ontology-based data access. Semantic Web 2(1):43-53.
13. Chong, E. I.; Das, S.; Eadon, G.; and Srinivasan, J. 2005. An efficient sql-based rdf querying scheme. In Böhm, K.; Jensen, C. S.; Haas, L. M.; Kersten, M. L.; Larson, P.-Å.; and Ooi, B. C., eds., VLDB, 1216-1227. ACM.
14. Dantsin, E.; Eiter, T.; Georg, G.; and Voronkov, A. 2001. Complexity and expressive power of logic programming. ACM Comput. Surv. 33(3):374-425.
15. Deutsch, A.; Nash, A.; and Remmel, J. B. 2008. The chase revisisted. In Proc. of PODS, 149-158.
16. Fagin, R.; Kolaitis, P. G.; Miller, R. J.; and Popa, L. 2005. Data exchange: Semantics and query answering. Theor. Comput. Sci. 336(1):89-124.
17. Gottlob, G., and Schwentick, T. 2011. Rewriting ontological queries into small nonrecursive datalog programs. In Rosati, R.; Rudolph, S.; and Zakharyaschev, M., eds., Description Logics, Volume 745 of CEUR Workshop Proceedings. CEUR-WS.org.
18. Gottlob, G.; Orsi, G.; and Pieris, A. 2011. Ontological queries: Rewriting and optimization. In Proc. of ICDE.
19. Grau, B. C.; Horrocks, I.; Motik, B.; Parsia, B.; Patel-Schneider, P.; and Sattler, U. 2008. Owl 2: The next step for owl. Web Semantics: Science, Services and Agents on the World Wide Web 6(4):309-322. ¡ce: title¿Semantic Web Challenge 2006/2007¡/ce:title¿.
20. Johnson, D. S., and Klug, A. C. 1984. Testing containment of conjunctive queries under functional and inclusion dependencies. J. Comput. Syst. Sci. 28(1):167-189.
21. Kikot, S.; Kontchakov, R.; and Zakharyaschev, M. 2011. On (In)Tractability of OBDA with OWL2QL. In Proc. DL 2011.
22. Kikot, S.; Kontchakov, R.; and Zakharyaschev, M. 2012. Conjunctive Query Answering with OWL2QL. In Proc. KR 2012, to appear.
23. Kontchakov, R.; Lutz, C.; Toman, D.; Wolter, F.; and Zakharyaschev, M. 2010. The combined approach to query answering in dl-lite. In Lin, F.; Sattler, U.; and Truszczynski, M., eds., KR. AAAI Press.
24. Kontchakov, R.; Lutz, C.; Toman, D.; Wolter, F.; and Zakharyaschev, M. 2011. The combined approach to ontology-based data access. In IJCAI.
25. Maier, D.; Mendelzon, A. O.; and Sagiv, Y. 1979. Testing implications of data dependencies. ACM Trans. Database Syst. 4(4):455-469.
26. Orsi, G., and Pieris, A. 2011. Optimizing query answering under ontological constraints. PVLDB 4(11):1004-1015.
27. Pérez-Urbina, H.; Horrocks, I.; and Motik, B. 2009. Efficient query answering for owl 2. In Bernstein, A.; Karger, D. R.; Heath, T.; Feigenbaum, L.; Maynard, D.; Motta, E.; and Thirunarayan, K., eds., International Semantic Web Conference, Volume 5823 of Lecture Notes in Computer Science, 489-504. Springer.
28. Pérez-Urbina, H.; Motik, B.; and Horrocks, I. 2009. Tractable query answering and rewriting under description logic constraints. Journal of Applied Logic 8(2):151-232.
29. Poggi, A.; Lembo, D.; Calvanese, D.; De Giacomo, G.; Lenzerini, M.; and Rosati, R. 2008. Linking data to ontologies. J. Data Semantics 10:133-173.
30. Rosati, R., and Almatelli, A. 2010. Improving query answering over DL-Lite ontologies. In Proc. KR.
31. Virgilio, R. D.; Orsi, G.; Tanca, L.; and Torlone, R. 2011. Semantic data markets: a flexible environment for knowledge management. In Macdonald, C.; Ounis, I.; and Ruthven, I., eds., CIKM, 1559-1564. ACM.