. F. Baa03 and . Baader, Terminological cycles in a description logic with existential restrictions, IJCAI'03, pp.325-330, 2003.

B. J. Baget, M. Lecì, and M. Mugnier, On rules with existential variables: Walking the decidability line, KR'10, pp.466-476, 2010.
DOI : 10.1016/j.artint.2011.03.002
URL : https://hal.archives-ouvertes.fr/lirmm-00587012

J. Baget, M. Lecì-ere, M. Mugnier, and E. Salvat, Extending decidable cases for rules with existential variables, IJCAI'09, pp.677-682, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00410130

J. Baget, M. Lecì-ere, M. Mugnier, and E. Salvat, On rules with existential variables: Walking the decidability line, Artificial Intelligence, vol.175, issue.9-10, pp.9-101620, 2011.
DOI : 10.1016/j.artint.2011.03.002
URL : https://hal.archives-ouvertes.fr/lirmm-00587012

J. Baget, M. Mugnier, S. Rudolph, and M. Thomazo, Walking the complexity lines for generalized guarded existential rules, IJCAI'11, pp.712-717, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00618081

C. A. Caì-i, G. Gottlob, and M. Kifer, Taming the infinite chase: Query answering under expressive relational constraints, KR'08, pp.70-80, 2008.

C. D. +-07, G. Calvanese, D. De-giacomo, M. Lembo, R. Lenzerini et al., Tractable reasoning and efficient query answering in description logics: The DL-Lite family, J. Autom. Reasoning, vol.39, issue.3, pp.385-429, 2007.

C. A. Caì-i, G. Gottlob, and T. Lukasiewicz, A general datalog-based framework for tractable query answering over ontologies, PODS'09, pp.77-86, 2009.

C. A. Caì-i, G. Gottlob, and A. Pieris, Query answering under non-guarded rules in datalog+, RR'10, pp.1-17, 2010.

C. Civili and R. Rosati, A Broad Class of First-Order Rewritable Tuple-Generating Dependencies, Datalog CTS11. A. Chortaras, D. Trivela, and G. B. Stamou. Optimized query rewriting for OWL 2 QL. In CADE, pp.68-80, 2011.
DOI : 10.1007/978-3-642-32925-8_8

G. G. Gottlob, G. Orsi, and A. Pieris, Ontological queries: Rewriting and optimization, 2011 IEEE 27th International Conference on Data Engineering, pp.2-13, 2011.
DOI : 10.1109/ICDE.2011.5767965

G. Gottlob, T. Schwentick, G. Stoilos, and B. Grau, Rewriting ontological queries into small nonrecursive datalog programs Benchmarking ontology-based query rewriting systems, AAAI, 2012.

K. S. Kikot, R. Kontchakov, and M. Zakharyaschev, Polynomial Conjunctive Query Rewriting under Unary Inclusion Dependencies, RR'11, pp.124-138, 2011.
DOI : 10.1007/978-3-540-71070-7_16
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.3527

M. Krötzsch and S. Rudolph, Extending decidable existential rules by joining acyclicity and guardedness, IJCAI'11, pp.963-968, 2011.

M. Mugnier, Ontological Query Answering with Existential Rules, RR'11, pp.2-23, 2011.
DOI : 10.1007/3-540-61534-2_16
URL : https://hal.archives-ouvertes.fr/lirmm-00618296

P. H. Pérez-urbina, I. Horrocks, and B. Motik, Efficient query answering for owl 2 Improving query answering over DL-Lite ontologies, ISWC'09 KR'10, pp.489-504, 2009.

R. M. Rodriguez-muro, D. Calvanese, and M. Mugnier, High performance query answering over DLlite ontologies Sound and Complete Forward and Backward Chainings of Graph Rules, KR, 2012. SM96. E. Salvat and ICCS'96, volume 1115 of LNAI VSS12. T. Venetis, G. Stoilos, and G. B. Stamou. Incremental query rewriting for OWL 2 QL. In Description Logics, pp.248-262, 1996.