F. Baader, S. Brandt, and C. Lutz, Pushing the EL envelope, IJ-CAI'05, pp.364-369, 2005.

J. Baget, Improving the forward chaining algorithm for conceptual graphs rules, pp.407-414, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00918126

J. Baget, M. Leclère, 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. Leclère, M. Mugnier, and E. Salvat, On rules with existential variables: Walking the decidability line, Artificial Intelligence, vol.175, issue.9, pp.1620-1654, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00587012

C. Beeri and M. Vardi, The implication problem for data dependencies, ICALP'81, vol.115, pp.73-85, 1981.

C. Beeri and M. Y. Vardi, A proof procedure for data dependencies, Journal of the ACM, vol.31, issue.4, pp.718-741, 1984.

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

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

F. Calimeri, S. Cozza, G. Ianni, and N. Leone, Computable functions in asp: Theory and implementation, Logic Programming, pp.407-424, 2008.

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

A. K. Chandra, H. R. Lewis, and J. A. Makowsky, Embedded implicational dependencies and their inference problem, STOC'81, pp.342-354, 1981.

B. Grau, I. Horrocks, M. Krötzsch, C. Kupke, D. Magka et al., Acyclicity notions for existential rules and their application to query answering in ontologies, J. Art. Intell. Res, vol.47, pp.741-808, 2013.

M. Dao-tran, T. Eiter, M. Fink, G. Weidinger, and A. Weinzierl, Omiga: an open minded grounding on-the-fly answer set solver, Logics in Artificial Intelligence, pp.480-483, 2012.

A. Deutsch, A. Nash, and J. B. Remmel, The chase revisited, PODS'08, pp.149-158, 2008.

R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa, Data exchange: semantics and query answering, Theor. Comput. Sci, vol.336, issue.1, pp.89-124, 2005.

M. Gelfond and V. Lifschitz, The stable model semantics for logic programming, ICLP/SLP, pp.1070-1080, 1988.

A. Hernich, C. Kupke, T. Lukasiewicz, and G. Gottlob, Well-founded semantics for extended datalog and ontological reasoning, PODS, pp.225-236, 2013.

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

B. Lamare, Optimisation de la notion de dépendance', Internship report, ENS Cachan and LIRMM/ INRIA, 2012.

M. Leclère, M. Mugnier, and S. Rocher, Kiabora: An analyzer of existential rule bases, RR, pp.241-246, 2013.

C. Lefèvre and P. Nicolas, A first order forward chaining approach for answer set computing, LPNMR, 2009.

Y. Lierler and V. Lifschitz, One more decidable class of finitely ground programs, Logic Programming, pp.489-493, 2009.

D. Magka, M. Krötzsch, and I. Horrocks, Computing stable models for nonmonotonic existential rules, IJCAI, 2013.

D. Maier, A. O. Mendelzon, and Y. Sagiv, Testing implications of data dependencies, ACM Trans. Database Syst, vol.4, issue.4, pp.455-469, 1979.

B. Marnette, Generalized schema-mappings: from termination to tractability, PODS, pp.13-22, 2009.

A. Onet, The chase procedure and its applications in data exchange, Data Exchange, Information, and Streams, pp.1-37, 2013.