Compact rewritings for existential rules

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2013, Pages 1125-1131

  Thomazo, Michaël ^a  

^a UNIV MONTPELLIER   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONJUNCTIVE QUERIES; DATALOG; DESCRIPTION LOGIC; EXISTENTIAL FORMULA; LARGE DATABASE; NOVEL ALGORITHM; QUERY REWRITINGS; SOUND AND COMPLETE;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; DATA DESCRIPTION; QUERY PROCESSING;

QUERY LANGUAGES;

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

References (22)

1. Franz Baader, Diego Calvanese, Deborah McGuinness, Daniele Nardi, and Peter Patel-Schneider, editors. The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, second edition, 2007.
2. F. Baader. Terminological cycles in a description logic with existential restrictions. In IJCAI, pages 325-330, 2003.
3. J.-F. Baget, M. Leclere, M.-L. Mugnier, and E. Salvat. Extending Decidable Cases for Rules with Existential Variables. In IJCAI, pages 677-682, 2009.
4. Jean-François Baget, Michel Leclere, Marie-Laure Mugnier, and Eric Salvat. On Rules with Existential Variables: Walking the Decidability Line. Artif. Intell., 175(9-10):1620-1654, 2011.
5. A. Calì, G. Gottlob, and M. Kifer. Taming the Infinite Chase: Query Answering under Expressive Relational Constraints. In KR, pages 70-80, 2008.
6. Andrea Calì, Georg Gottlob, and Andreas Pieris. Query rewriting under non-guarded rules. In AMW, 2010.
7. Andrea Calì, Georg Gottlob, and Thomas Lukasiewicz. A general datalog-based framework for tractable query answering over ontologies. J. Web Sem., 14:57-83, 2012.
8. 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(3):385-429, 2007.
9. Alexandros Chortaras, Despoina Trivela, and Giorgos B. Stamou. Optimized query rewriting for OWL 2 QL. In CADE, pages 192-206, 2011.
10. Georg Gottlob and Thomas Schwentick. Rewriting ontological queries into small nonrecursive datalog programs. In KR, 2012.
11. Georg Gottlob, Giorgio Orsi, and Andreas Pieris. Ontological queries: Rewriting and optimization. In ICDE, pages 2-13, 2011.
12. Martha Imprialou, Giorgos Stoilos, and Bernardo Cuenca Grau. Benchmarking ontologybased query rewriting systems. In AAAI, 2012.
13. Mélanie König, Michel Leclere, Marie-Laure Mugnier, and Michaël Thomazo. A sound and complete backward chaining algorithm for existential rules. In RR, pages 122-138, 2012.
14. Roman Kontchakov, Carsten Lutz, David Toman, Frank Wolter, and Michael Zakharyaschev. The Combined Approach to Ontology-Based Data Access. In IJCAI, pages 2656-2661, 2011.
15. Carten Lutz, Inanç Seylan, David Toman, and Franck Wolter. The combined approach to OBDA: Taming role hierarchies using filters. In SSWS+HPCSW, 2012.
16. Héctor Pérez-Urbina, Ian Horrocks, and Boris Motik. Efficient query answering for OWL 2. In International Semantic Web Conference, pages 489-504, 2009.
17. Mariano Rodriguez-Muro and Diego Calvanese. High performance query answering over DL-lite ontologies. In KR, 2012.
18. R. Rosati and A. Almatelli. Improving query answering over dl-lite ontologies. In KR, 2010.
19. Eric Salvat and Marie-Laure Mugnier. Sound and complete forward and backward chainingd of graph rules. In ICCS, pages 248-262, 1996.
20. Giorgio Stefanoni, Boris Motik, and Ian Horrocks. Small datalog query rewritings for EL. In Description Logics, 2012.
21. Michaël Thomazo, Jean-François Baget, Marie-Laure Mugnier, and Sebastian Rudolph. A generic querying algorithm for greedy sets of existential rules. In KR, 2012.
22. Tassos Venetis, Giorgos Stoilos, and Giorgos B. Stamou. Incremental query rewriting for OWL 2 QL. In Description Logics, 2012.