S. Abiteboul, Boundedness is undecidable for datalog programs with a single recursive rule, Information Processing Letters, vol.32, pp.281-287, 1989.

S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases: The Logical Level, 1995.

F. Baader, S. Brandt, and C. Lutz, Pushing the el envelope, Proceedings of the 19th International Joint Conference on Artificial Intelligence. IJCAI'05, pp.364-369, 2005.

J. Baget, F. Garreau, M. Mugnier, and S. Rocher, Extending acyclicity notions for existential rules, ECAI 2014 -21st European Conference on Artificial Intelligence, pp.39-44, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01092757

J. Baget, M. Leclère, and M. Mugnier, Walking the decidability line for rules with existential variables, Proceedings of the Twelfth International Conference on Principles of Knowledge Representation and Reasoning. KR'10, pp.466-476, 2010.
URL : https://hal.archives-ouvertes.fr/lirmm-00441907

J. Baget, M. Leclère, M. Mugnier, and E. Salvat, Extending decidable cases for rules with existential variables, Proceedings of the 21st International Jont Conference on Artifical Intelligence. IJCAI'09, pp.677-682, 2009.
URL : https://hal.archives-ouvertes.fr/lirmm-00410130

J. Baget, M. Mugnier, S. Rudolph, and M. Thomazo, Walking the complexity lines for generalized guarded existential rules, IJCAI 2011, Proceedings of the 22nd International Joint Conference on Artificial Intelligence, pp.712-717, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00618081

J. Baget, M. Leclère, M. Mugnier, and E. Salvat, On Rules with Existential Variables: Walking the Decidability Line, Artificial Intelligence, vol.175, pp.1620-1654, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00587012

C. Beeri and M. Y. Vardi, The implication problem for data dependencies, International Colloquium on Automata, Languages, and Programming, pp.73-85, 1981.

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

P. Bourhis, M. Leclère, M. Mugnier, S. Tison, F. Ulliana et al., Oblivious and semi-oblivious boundedness for existential rules, Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, vol.2019, pp.1581-1587, 2019.
URL : https://hal.archives-ouvertes.fr/lirmm-02148142

A. Calì, G. Gottlob, and M. Kifer, Taming the infinite chase: Query answering under expressive relational constraints, Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning. KR'08, pp.70-80, 2008.

A. Calì, G. Gottlob, and T. Lukasiewicz, A general datalog-based framework for tractable query answering over ontologies, Proceedings of the Twenty-Eighth ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems. PODS '09, pp.77-86, 2009.

D. Calvanese, G. De-giacomo, D. Lembo, M. Lenzerini, and R. Rosati, DL-Lite: Tractable description logics for ontologies, Proceedings of the 20th National Conference on Artificial Intelligence -Volume 2. AAAI'05, pp.602-607, 2005.

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, Journal of Automated Reasoning (JAR), vol.39, pp.385-429, 2007.

D. Carral, I. Dragoste, and M. Krötzsch, Restricted chase (non)termination for existential rules with disjunctions, Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, pp.922-928, 2017.

A. K. Chandra and P. M. Merlin, Optimal implementation of conjunctive queries in relational data bases, Proceedings of the 9th Annual ACM Symposium on Theory of Computing, pp.77-90, 1977.

S. S. Cosmadakis, H. Gaifman, P. C. Kanellakis, and M. Y. Vardi, Decidable optimization problems for database logic programs (preliminary report), ACM Symposium on Theory of Computing, pp.477-490, 1988.

B. Cuenca-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. Artif. Int. Res, vol.47, pp.741-808, 2013.

S. Delivorias, M. Leclère, M. Mugnier, and F. Ulliana, On the k-boundedness for existential rules, Computing Research Repository (initially published in Rules and Reasoning -Second International Joint Conference, 2018.
URL : https://hal.archives-ouvertes.fr/lirmm-01921140

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 '08, pp.149-158, 2008.

R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa, Data exchange: Semantics and query answering, Theoretical Computer Science, vol.336, pp.89-124, 2005.

H. Gaifman, H. G. Mairson, Y. Sagiv, and M. Y. Vardi, Undecidable optimization problems for database logic programs, Journal of the Association for Computing Machinery, vol.40, pp.683-713, 1993.

T. Gogacz and J. Marcinkowski, All-instances termination of chase is undecidable, International Colloquium on Automata, Languages, and Programming 2014 Proceedings, Part II, pp.293-304, 2014.

G. Gottlob, G. Orsi, A. Pieris, and M. Simkus, Datalog and its extensions for semantic web databases, Reasoning Web, pp.54-77, 2012.

G. Grahne and A. Onet, Anatomy of the chase, Fundamenta Informaticae, vol.157, pp.221-270, 2018.

I. Guessarian and M. V. Peixoto, About boundedness for some datalog and datalog neg programs, Journal of Logic and Computation, vol.4, pp.375-403, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00020727

A. Hernich and N. Schweikardt, Cwa-solutions for data exchange settings with target dependencies, Proceedings of the Twenty-Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp.113-122, 2007.

G. G. Hillebrand, P. C. Kanellakis, H. G. Mairson, and M. Y. Vardi, Undecidable boundedness problems for datalog programs, Journal of Logic Programming, vol.25, pp.163-190, 1995.

M. Krötzsch and S. Rudolph, Extending decidable existential rules by joining acyclicity and guardedness, Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence -Volume Volume Two. IJCAI'11, pp.963-968, 2011.

M. Krötzsch, S. Rudolph, and P. Hitzler, Complexity boundaries for Horn description logics, Proceedings of the 22nd National Conference on Artificial Intelligence, vol.1, pp.452-457, 2007.

M. Leclère, M. Mugnier, and F. Ulliana, On bounded positive existential rules, Proceedings of the 29th International Workshop on Description Logics, 2016.

N. Leone, M. Manna, G. Terracina, and P. Veltri, Efficiently computable Datalog? programs, Proceedings of the Thirteenth International Conference on Principles of Knowledge Representation and Reasoning. KR'12, pp.13-23, 2012.

J. Marcinkowski, Achilles, turtle, and undecidable boundedness problems for small datalog programs, Society for Industrial and Applied Mathematics Journal on Computing, vol.29, pp.231-257, 1999.

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

M. Mugnier and M. Thomazo, An introduction to ontology-based query answering with existential rules, Reasoning Web, pp.245-278, 2014.
URL : https://hal.archives-ouvertes.fr/lirmm-01089990

S. 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, J. Baget, M. Mugnier, and S. Rudolph, A generic querying algorithm for greedy sets of existential rules, Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012.
URL : https://hal.archives-ouvertes.fr/lirmm-00763518