B. Baader, . Lutz, F. Baader, S. Brandt, C. Lutz et al., The Complexity of Rules and Constraints, IJCAI'05, vol.16, pp.425-465, 2002.

[. Baget, Extending decidable cases for rules with existential variables, IJCAI'09, pp.677-682, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00410130

[. Baget, 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

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

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

G. Calì, A. Kifer-;-calì, G. Gottlob, M. Kifer, G. Calì et al., Taming the infinite chase : Query answering under expressive relational constraints, PODS'09, pp.77-86, 2008.

G. Cal?, A. Gottlob, G. Lukasiewicz, and T. , Tractable query answering over ontologies with datalog±, Proceedings of the DL Home 22nd International Workshop on Description Logics, 2009.

, Tractable reasoning and efficient query answering in description logics : The DL-Lite family, Logic Programming, vol.39, pp.342-354, 1981.

. [cuenca-grau, Acyclicity conditions and their application to query answering in description logics, KR, 2012.

. [cuenca-grau, Acyclicity notions for existential rules and their application to query answering in ontologies, Journal of Artificial Intelligence Research, vol.47, pp.741-808, 2013.

. Dao-tran, Omiga : an open minded grounding on-the-fly answer set solver, Logics in Artificial Intelligence, pp.149-158, 2008.

, Data exchange : Semantics and query answering, ICDT'03, pp.207-224, 2003.

, Data exchange : semantics and query answering, Theor. Comput. Sci, vol.336, issue.1, pp.89-124, 2005.

L. Ferraris, P. Lifschitz-;-ferraris, J. Lee, and V. Lifschitz, Stable models and circumscription, Artif. Intell, vol.175, issue.1, pp.236-263, 2011.

M. Gelfond, G. Gottlob, A. Hernich, C. Kupke, and T. Lukasiewicz, Equality-friendly well-founded semantics and applications to description logics, Description Logics, 2007.

M. Krötzsch, S. Rudolph, C. Lefèvre, N. , and P. , Extending decidable existential rules by joining acyclicity and guardedness, Logic Programming and Nonmonotonic Reasoning, pp.196-208, 2009.

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

[. Liu, Logic programs with abstract constraint atoms : The role of computations, Artificial Intelligence, vol.174, issue.3-4, pp.295-315, 2010.

K. Magka, D. Horrocks-;-magka, M. Krötzsch, and I. Horrocks, Generalized schemamappings : from termination to tractability, Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013, pp.13-22, 2009.

M. Mugnier, J. You, H. Zhang, and Y. Zhang, Disjunctive logic programs with existential quantification in rule heads, RR'11, vol.13, pp.563-578, 2011.