J. Baget, M. Leclère, M. Mugnier, and E. Salvat, On rules with existential variables: Walking the decidability line, Artif. Intell, vol.175, issue.9, pp.1620-1654, 2011.
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, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp.712-717, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00618081

C. Beeri and M. Y. Vardi, The implication problem for data dependencies, Automata, Languages and Programming, 8th Colloquium, vol.115, pp.73-85, 1981.

D. Carral, I. Dragoste, M. Krötzsch-;-diego-calvanese, G. D. Giacomo, D. Lembo et al., Tractable reasoning and efficient query answering in description logics: The DL-Lite family, Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, vol.39, pp.385-429, 2007.

A. Calì, G. Gottlob, and T. Lukasiewicz, Datalog extensions for tractable query answering over ontologies, Semantic Web Information ManagementA Model-Based Perspective, pp.249-279, 2009.

M. Calautti, G. Gottlob, and A. Pieris, Chase termination for guarded existential rules, Proceedings of the 34th ACM Symposium on Principles of Database Systems, PODS 2015, pp.91-103, 2015.

A. Deutsch, A. Nash, and J. B. Remmel, The chase revisited, Proceedings of the Twenty-Seventh ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS 2008, pp.149-158, 2008.

R. Fagin, A normal form for relational databases that is based on domians and keys, ACM Trans. Database Syst, vol.6, issue.3, pp.387-415, 1981.

R. Fagin, G. Phokion, R. J. Kolaitis, L. Miller, I. Grau et al., Acyclicity notions for existential rules and their application to query answering in ontologies, J. Artif. Intell. Res, vol.336, issue.1, pp.741-808, 2005.

T. Gogacz and J. Marcinkowski, All-instances termination of chase is undecidable, Automata, Languages, and Programming-41st International Colloquium, ICALP, vol.8573, pp.293-304, 2014.

A. Hernich, Computing universal models under guarded tgds, 15th International Conference on Database Theory, ICDT '12, pp.222-235, 2012.

M. Leclère, M. Mugnier, M. Thomazo, and F. Ulliana, A single approach to decide chase termination on linear existential rules, 2018.

B. Marnette, Generalized schema-mappings: from termination to tractability, Proceedings of the Twenty-Eigth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp.13-22, 2009.

M. , L. Mugnier, and M. Thomazo, An introduction to ontology-based query answering with existential rules, Reasoning Web. Reasoning on the Web in the Big Data Era-10th International Summer School, pp.245-278, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-01089990

A. Onet, The chase procedure and its applications, Concordia University, 2012.

. Swan-rocher, Querying Existential Rule Knowledge Bases: Decidability and Complexity. (Interrogation de Bases de Connaissances avec Règles Existentielles : Décidabilité et Complexité), 2016.

M. Thomazo, Conjunctive Query Answering Under Existential Rules-Decidability, Complexity, and Algorithms, 2013.
URL : https://hal.archives-ouvertes.fr/tel-00925722