A. S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases, 1995.

A. H. Andréka, J. Van-benthem, and I. Németi, Modal languages and bounded fragments of FOL, 1996.

-. J. Bag04, B. F. Baget, S. Baader, C. Brandt, and . Lutz, Improving the forward chaining algorithm for conceptual graphs rules Pushing the el envelope Walking the decidability line for rules with existential variables, KR'04 IJCAI'05 KR'10, pp.407-414, 2004.

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.

J. Baget, M. Mugnier, S. Rudolph, M. Thomazo, . J. Bmt11 et al., Walking the complexity lines for generalized guarded existential rules Towards farsighted dependencies for existential rules The implication problem for data dependencies Vardi. A proof procedure for data dependencies, IJCAI'11 ICALP'81 CGK08. A.Caì ?, G. Gottlob, and M. Kifer. Taming the infinite chase: Query answering under expressive relational constraints. In KR'08, pp.73-85718, 1981.

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 A general datalog-based framework for tractable query answering over ontologies, PODS'09, pp.385-429, 2007.

C. A. Caì-i, G. Gottlob, and T. Lukasiewicz, Datalog extensions for tractable query answering over ontologies, Semantic Web Information Management: A Model-Based Perspective, pp.249-279, 2010.

C. A. +-10b, 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, Advanced processing for ontological queries, PVLDB, vol.3, issue.1, pp.554-565, 2010.

C. A. Caì-i, G. Gottlob, A. Pieris, . A. Clm81, H. R. Chandra et al., Query answering under non-guarded rules in datalog+ Embedded implicational dependencies and their inference problem Graph-based Knowledge Representation and Reasoning?Computational Foundations of Conceptual Graphs Advanced Information and Knowledge Processing Courcelle. The monadic second-order logic of graphs: I. recognizable sets of finite graphs The implication problem for functional and inclusion dependencies is undecidable, STOC'81, pp.1-17, 1981.

D. E. Dantsin, T. Eiter, G. Gottlob, and A. Voronkov, Complexity and expressive power of logic programming, ACM Computing Surveys, vol.33, issue.3, pp.374-425, 2001.
DOI : 10.1145/502807.502810

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, L. Popa, . M. Kr11 et al., Data exchange, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '03, pp.89-124, 1984.
DOI : 10.1145/773153.773163