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, Proc. 19th Int. Joint Conf. on Artificial Intelligence (IJCAI'05), 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, Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning, 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, A. Schaerf, A. Caì-i, G. Gottlob et al., Decidable reasoning in terminological knowledge representation systems Taming the infinite chase: Query answering under expressive relational constraints A general datalog-based framework for tractable query answering over ontologies, Proceedings of the Eleventh International Conference on the Principles of Knowledge Representation and Reasoning Proceedings of the 28th symposium on Principles of database systems (PODS'09), pp.109-138, 1993.

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

R. Kontchakov, C. Lutz, D. Toman, F. Wolter, and M. Zakharyaschev, The combined approach to ontologybased 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, Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI'07), pp.452-457, 2007.

C. Lutz, D. Toman, and F. Wolter, Conjunctive query answering in the description logic el using a relational database system, Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence, 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