A. S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases Improving the forward chaining algorithm for conceptual graphs rules, KR'04, pp.407-414, 1995.

B. F. Baader, S. Brandt, and C. Lutz, Pushing the el envelope, IJCAI'05, pp.364-369, 2005.

B. J. Baget, M. Lecì, and M. Mugnier, On rules with existential variables: Walking the decidability line, KR'10, pp.466-476, 2010.
DOI : 10.1016/j.artint.2011.03.002
URL : https://hal.archives-ouvertes.fr/lirmm-00587012

J. Baget, M. Lecì-ere, 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. Lecì-ere, M. Mugnier, and E. Salvat, On rules with existential variables: Walking the decidability line The Complexity of Rules and Constraints, Artificial Intelligence J. Artif. Intell. Res. (JAIR), vol.175, issue.16, pp.9-101620, 2002.

B. J. Baget, M. Mugnier, S. Rudolph, and M. Thomazo, Walking the complexity lines for generalized guarded existential rules, IJCAI'11, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00618081

J. Baget, M. Mugnier, M. Thomazo, -. J. Bs06, E. Baget et al., Towards Farsighted Dependencies for Existential Rules Rules dependencies in backward chaining of conceptual graphs rules The implication problem for data dependencies A proof procedure for data dependencies, ICCS ICALP'81, pp.102-116, 1981.

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.

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

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

C. A. +-10, G. Caì-i, T. Gottlob, B. Lukasiewicz, A. Marnette et al., Datalog+/-: A family of logical knowledge representation and query languages for new applications, LICS, pp.228-242, 2010.

C. A. Caì-i, G. Gottlob, and A. Pieris, Query answering under non-guarded rules in datalog+, RR, pp.1-17, 2010.

C. A. Chandra, H. R. Lewis, and J. A. Makowsky, Embedded implicational dependencies and their inference problem, Proceedings of the thirteenth annual ACM symposium on Theory of computing , STOC '81, pp.342-354, 1981.
DOI : 10.1145/800076.802488

D. A. Deutsch, A. Nash, and J. B. , The chase revisited Reformulation of xml queries and constraints, PODS'08 ICDT'03, pp.149-158, 2003.

F. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa, Data exchange: Semantics and query answering, ICDT'03, pp.207-224, 2003.
DOI : 10.1016/j.tcs.2004.10.033
URL : http://doi.org/10.1016/j.tcs.2004.10.033

F. R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa, Data exchange, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.89-124167, 1984.
DOI : 10.1145/773153.773163

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

L. C. Lutz, D. Toman, and F. Wolter, Conjunctive query answering in the description logic el using a relational database system Generalized schema-mappings: from termination to tractability, IJCAI'09 PODS, pp.2070-2075, 2009.

M. Meier, M. Schmidt, G. Lausen, S. E. Salvat, and M. Mugnier, On chase termination beyond stratification Sound and Complete Forward and Backward Chainings of Graph Rules, ICCS'96 Conceptual Structures: Information Processing in Mind and Machine, pp.970-981, 1984.