S. Abiteboul, Boundedness is undecidable for datalog programs with a single recursive rule, Inf. Process. Lett, vol.32, issue.6, pp.281-287, 1989.

, Foundations of Databases: The Logical Level, 1995.

. Blm10-jean-françois, M. Baget, and M. Mugnier, Walking the decidability line for rules with existential variables, 2010.

. Blms09-jean-françois, . Baget, M. Michellecì-ere, E. Mugnier, and . Salvat, Extending decidable cases for rules with existential variables, IJCAI 2009, pp.677-682, 2009.

B. Baget, M. Lecì-ere, 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. A. Caì-i, G. Gottlob, and M. Kifer, Taming the infinite chase: Query answering under expressive relational constraints, KR'08, pp.70-80, 2008.

G. Cgl-+-05-d.-calvanese, D. De-giacomo, M. Lembo, R. Lenzerini, and . Rosati, DL-Lite: Tractable description logics for ontologies, AAAI, pp.602-607, 2005.

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

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

F. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa, Data Exchange: Semantics and Query Answering. Theor. Comput. Sci, vol.336, issue.1, p.14, 2005.

T. Gogacz and J. Marcinkowski, All-instances termination of chase is undecidable, ICALP 2014 Proceedings, Part II, pp.293-304, 2014.

H. G. Gmsv93-haim-gaifman, Y. Mairson, M. Y. Sagiv, and . Vardi, Undecidable optimization problems for database logic programs, J. ACM, vol.40, issue.3, pp.683-713, 1993.

G. Gops12-georg-gottlob and . Orsi, Andreas Pieris, and Mantas Simkus. Datalog and its extensions for semantic web databases, Reasoning Web, p.94, 2012.

I. Guessarian and M. V. Peixoto, About boundedness for some datalog and datalog neg programs, J. Log. Comput, vol.4, issue.4, pp.375-403, 1994.
URL : https://hal.archives-ouvertes.fr/hal-00020727

G. Hkmv95-gerd, P. C. Hillebrand, H. G. Kanellakis, M. Y. Mairson, and . Vardi, Undecidable boundedness problems for datalog programs, J. Log. Program, vol.25, issue.2, pp.163-190, 1995.

K. M. Krötzsch, S. Rudolph, and P. Hitzler, Complexity boundaries for Horn description logics, Proc. of AAAI, pp.452-457, 2007.

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

M. Lmu16-michellecì-ere, F. Mugnier, and . Ulliana, On bounded positive existential rules, Proceedings of the 29th International Workshop on Description Logics, p.9, 2016.

C. Lutz, D. Toman, and F. Wolter, Conjunctive query answering in the description logic E L using a relational database system, Proc. of IJCAI, pp.2070-2075

J. Marcinkowski, Achilles, turtle, and undecidable boundedness problems for small datalog programs, SIAM J. Comput, vol.29, issue.1, pp.231-257, 1999.

B. Marnette, Generalized schema-mappings: from termination to tractability, PODS, p.14, 2009.
DOI : 10.1145/1559795.1559799

M. , L. Mugnier, and M. Thomazo, An introduction to ontology-based query answering with existential rules, Reasoning Web, pp.245-278, 2014.
DOI : 10.1007/978-3-319-10587-1_6
URL : https://hal.archives-ouvertes.fr/lirmm-01089990

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