Polynomial combined rewritings for existential rules

Proceedings of the International Conference on Knowledge Representation and Reasoning

Volumn , Issue , 2014, Pages 268-277

  Gottlob, Georg ^a   Manna, Marco ^b   Pieris, Andreas ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF CALABRIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ONTOLOGY; POLYNOMIALS; QUERY PROCESSING; RELATIONAL DATABASE SYSTEMS;

CONJUNCTIVE QUERIES; FIRST ORDER; ONTOLOGY-BASED DATA ACCESS; QUERY ANSWERING; RELATIONAL DATABASE MANAGEMENT SYSTEMS;

KNOWLEDGE REPRESENTATION;

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

References (18)

1. Franz Baader, Sebastian Brandt, and Carsten Lutz. Pushing the EL envelope further. In Proc. of OWLED, 2008.
2. Jean-François Baget, Michel Leclère, Marie-Laure Mugnier, and Eric Salvat. On rules with existential variables: Walking the decidability line. Artif. Intell., 175(9-10):1620-1654, 2011.
3. Jean-François Baget, Marie-Laure Mugnier, Sebastian Rudolph, and Michaël Thomazo. Walking the complexity lines for generalized guarded existential rules. In Proc. of IJCAI, pages 712-717, 2011.
4. 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.
5. Andrea Calì, Georg Gottlob, and Andreas Pieris. Towards more expressive ontology languages: The query answering problem. Artif. Intell., 193:87-128, 2012.
6. Andrea Calì, Georg Gottlob, and Michael Kifer. Taming the infinite chase: Query answering under expressive relational constraints. J. Artif. Intell. Res., 48:115-174, 2013.
7. 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.
8. Ashok K. Chandra and Philip M. Merlin. Optimal implementation of conjunctive queries in relational data bases. In Proc. of STOCS, pages 77-90, 1977.
9. Ronald Fagin, Phokion G. Kolaitis, Renée J. Miller, and Lucian Popa. Data exchange: Semantics and query answering. Theor. Comput. Sci., 336(1):89-124, 2005.
10. Georg Gottlob and Thomas Schwentick. Rewriting ontological queries into small nonrecursive datalog programs. In Proc. of KR, 2012.
11. Georg Gottlob, Marco Manna, and Andreas Pieris. Combining decidability paradigms for existential rules. TPLP, 13(4-5):877-892, 2013.
12. Stanislav Kikot, Roman Kontchakov, Vladimir V. Podolskii, and Michael Zakharyaschev. Exponential lower bounds and separation for query rewriting. In Proc. of ICALP, pages 263-274, 2012.
13. Roman Kontchakov, Carsten Lutz, David Toman, Frank Wolter, and Michael Zakharyaschev. The combined approach to query answering in DL-Lite. In Proc. of KR, 2010.
14. Roman Kontchakov, Carsten Lutz, David Toman, Frank Wolter, and Michael Zakharyaschev. The combined approach to ontology-based data access. In Proc. of IJCAI, pages 2656-2661, 2011.
15. Markus Krötzsch and Sebastian Rudolph. Extending decidable existential rules by joining acyclicity and guardedness. In Proc. of IJCAI, pages 963-968, 2011.
16. Nicola Leone, Marco Manna, Giorgio Terracina, and Pierfrancesco Veltri. Efficiently computable Datalog9 programs. In Proc. of KR, 2012.
17. Carsten Lutz, David Toman, and Frank Wolter. Conjunctive query answering in the description logic EL using a relational database system. In Proc. of IJCAI, pages 2070-2075, 2009.
18. Antonella Poggi, Domenico Lembo, Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini, and Riccardo Rosati. Linking data to ontologies. J. Data Semantics, 10:133-173, 2008.