H. Andréka, I. Németi, and J. Van-benthem, Modal Languages and Bounded Fragments of Predicate Logic, Journal of Philosophical Logic, vol.60, issue.5, pp.217-274, 1998.
DOI : 10.1023/A:1004275029985

F. Baader, D. Calvanese, D. Mcguinness, D. Nardi, and P. Patel-schneider, The Description Logic Handbook: Theory, Implementation, and Applications, 2007.
DOI : 10.1017/CBO9780511711787

F. Baader, S. Brandt, and C. Lutz, Pushing the EL envelope, IJCAI, pp.364-369, 2005.

J. Baget, M. Mugnier, S. Rudolph, and M. Thomazo, Walking the Complexity Lines for Generalized Guarded Existential Rules, IJCAI, pp.712-717, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00618081

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

C. Beeri and M. Vardi, A Proof Procedure for Data Dependencies, Journal of the ACM, vol.31, issue.4, pp.718-741, 1984.
DOI : 10.1145/1634.1636

M. Buchheit, F. M. Donini, and A. Schaerf, Decidable Reasoning in Terminological Knowledge Representation Systems Taming the Infinite Chase: Query Answering under Expressive Relational Constraints, KR, pp.109-138, 1993.

A. Caì-i, G. Gottlob, and T. Lukasiewicz, A General Datalog-Based Framework for Tractable Query Answering over Ontologies, PODS, pp.77-86, 2009.

D. Calvanese, G. D. Giacomo, D. Lembo, M. Lenzerini, and R. Rosati, Tractable Reasoning and Efficient Query Answering in Description Logics: The DL-Lite Family, Journal of Automated Reasoning, vol.104, issue.1,2, pp.385-429, 2007.
DOI : 10.1007/s10817-007-9078-x

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75, 1990.
DOI : 10.1016/0890-5401(90)90043-H
URL : https://hal.archives-ouvertes.fr/hal-00353765

R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa, Data exchange: semantics and query answering, Theoretical Computer Science, vol.336, issue.1, pp.89-124, 2005.
DOI : 10.1016/j.tcs.2004.10.033
URL : http://doi.org/10.1016/j.tcs.2004.10.033

R. Kontchakov, C. Lutz, D. Toman, F. Wolter, and M. Zakharyaschev, The Combined Approach to Ontology-Based Data Access, IJCAI, pp.2656-2661, 2011.

M. Krötzsch, R. , and S. , Extending Decidable Existential Rules by Joining Acyclicity and Guardedness, IJCAI, pp.963-968, 2011.

M. Krötzsch, S. Rudolph, and P. Hitzler, Complexity Boundaries for Horn Description Logics, AAAI, pp.452-457, 2007.

C. Lutz, D. Toman, and F. Wolter, Conjunctive Query Answering in the Description Logic EL Using a Relational Database System, IJCAI, pp.2070-2075, 2009.

B. Motik, R. Shearer, and I. Horrocks, Hypertableau reasoning for description logics, JAIR, vol.36, pp.165-228, 2009.

M. Ortiz, S. Rudolph, and M. , Query Answering in the Horn Fragments of the Description Logics SHOIQ and SROIQ, IJCAI, pp.1039-1044, 2011.

N. Robertson and P. D. Seymour, Graph minors. III. Planar tree-width, Journal of Combinatorial Theory, Series B, vol.36, issue.1, pp.49-64, 1984.
DOI : 10.1016/0095-8956(84)90013-3
URL : http://doi.org/10.1006/jctb.1999.1919

M. Thomazo, M. Mugnier, J. Baget, R. , and S. , A Generic Querying Algorithm for Greedy Sets of Existential Rules, Research Report, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00675560