Rewriting ontological queries into small nonrecursive datalog programs

CEUR Workshop Proceedings

Volumn 745, Issue , 2011, Pages 158-168

  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

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

FORMAL LANGUAGES; ONTOLOGY;

DATA DESCRIPTION;

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

References (22)

1. Alessandro Artale, Diego Calvanese, Roman Kontchakov, and Michael Zakharyaschev, The dl-lite family and relations, J. Artif. Intell. Res. (JAIR) 36 (2009), 1-69.
2. Catriel Beeri and Moshe Y. Vardi, The implication problem for data dependencies, Proc. of ICALP, 1981, pp. 73-85.
3. A. Cal?, G. Gottlob, and A. Pieris, Query rewriting under non-guarded rules, Proc. AMW, 2010.
4. Andrea Cal?, Georg Gottlob, and Michael Kifer, Taming the infinite chase: Query answering under expressive relational constraints, Proc. of KR, 2008, pp. 70-80.
5. Andrea Cal?, Georg Gottlob, and Thomas Lukasiewicz, A general datalog-based framework for tractable query answering over ontologies, Proc. of PODS, 2009, pp. 77-86.
6. Andrea Cal?, Georg Gottlob, and Andreas Pieris, Advanced processing for ontological queries, PVLDB 3 (2010), no. 1, 554-565.
7. , Query answering under non-guarded rules in datalog+/-, Proc. of RR, 2010, pp. 175-190.
8. , Towards more expressive ontology languages: The query answering problem, Tech. report, University of Oxford, Department of Computer Science, 2011, Submitted for publication - available from the authors.
9. Diego Calvanese, Giuseppe De Giacomo, Domenico Lembo, Maurizio Lenzerini, and Riccardo Rosati, Tractable reasoning and efficient query answering in description logics: The DL-lite family, J. Autom. Reasoning 39 (2007), no. 3, 385-429.
10. Evgeny Dantsin, Thomas Eiter, Gottlob Georg, and Andrei Voronkov, Complexity and expressive power of logic programming, ACM Comput. Surv. 33 (2001), no. 3, 374-425.
11. Alin Deutsch, Alan Nash, and Jeff B. Remmel, The chase revisisted, Proc. of PODS, 2008, pp. 149-158.
12. Georg Gottlob, Giorgio Orsi, and Andreas Pieris, Ontological queries: Rewriting and optimization, Proc. of ICDE, 2011.
13. Georg Gottlob and Thomas Schwentick, Rewriting ontological queries into small nonrecursive datalog programs, arXiv Computing Research Repository (CoRR) arXiv:1106.3767 (2011), extended version, available at http://arxiv.org/abs/ 1106.3767.
14. David S. Johnson and Anthony C. Klug, Testing containment of conjunctive queries under functional and inclusion dependencies, J. Comput. Syst. Sci. 28 (1984), no. 1, 167-189.
15. Roman Kontchakov, Carsten Lutz, David Toman, FrankWolter, and Michael Zakharyaschev, The combined approach to query answering in dl-lite, KR (Fangzhen Lin, Ulrike Sattler, and Miroslaw Truszczynski, eds.), AAAI Press, 2010.
16. The combined approach to ontology-based data access, IJCAI, 2011.
17. David Maier, Alberto O. Mendelzon, and Yehoshua Sagiv, Testing implications of data dependencies., ACM Trans. Database Syst. 4 (1979), no. 4, 455-469.
18. Giorgio Orsi and Andreas Pieris, Optimizing query answering under ontological constraints, PVLDB, 2011, to appear.
19. H. P'erez-Urbina, B. Motik, and I. Horrocks, Tractable query answering and rewriting under description logic constraints, Journal of Applied Logic 8 (2009), no. 2, 151-232.
20. Antonella Poggi, Domenico Lembo, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Riccardo Rosati, Linking data to ontologies, J. Data Semantics 10 (2008), 133-173.
21. R. Rosati and A. Almatelli, Improving query answering over DL-Lite ontologies, Proc. KR, 2010.
22. R.Kontchakov S. Kikot, Carsten Lutz, and M. Zakharyaschev, On (In)Tractability of OBDA with OWL2QL, Proc. DL, 2011.