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

M. Alviano, W. Faber, N. Leone, and M. Manna, Abstract, Theory and Practice of Logic Programming, vol.2, issue.4-5, pp.4-5, 2012.
DOI : 10.1145/976706.976708

H. Andréka, J. Van-benthem, and I. Németi, Modal Languages and Bounded Fragments of Predicate Logic, Journal of Philosophical Logic, vol.60, issue.5, pp.217-274, 1998.
DOI : 10.1023/A:1004275029985

A. Artale, D. Calvanese, R. Kontchakov, and M. Zakharyaschev, The DL-Lite family and relations, J. Artif. Intell. Res, vol.36, pp.1-69, 2009.

P. B. Baeza, Querying graph databases, pp.175-188, 2013.

J. F. Baget, M. Lecì-ere, M. L. Mugnier, and E. Salvat, On rules with existential variables: Walking the decidability line, Artificial Intelligence, vol.175, issue.9-10, pp.9-10, 2011.
DOI : 10.1016/j.artint.2011.03.002
URL : https://hal.archives-ouvertes.fr/lirmm-00587012

J. F. Baget, M. L. Mugnier, S. Rudolph, and M. Thomazo, Walking the complexity lines for generalized guarded existential rules, In: IJCAI. pp, pp.712-717, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00618081

V. Bárány, G. Gottlob, and M. Otto, Querying the guarded fragment, LICS. pp, pp.1-10, 2010.

V. Bárány, B. Ten-cate, and L. Segoufin, Guarded negation, pp.356-367, 2011.

C. Beeri and M. Y. Vardi, The implication problem for data dependencies, pp.73-85, 1981.
DOI : 10.1007/3-540-10843-2_7

P. Bourhis, M. Morak, and A. Pieris, The impact of disjunction on query answering under guarded-based existential rules, p.IJCAI, 2013.

A. Caì-i, G. Gottlob, and M. Kifer, Taming the infinite chase: Query answering under expressive relational constraints, J. Artif. Intell. Res, vol.48, pp.115-174, 2013.

A. Caì-i, G. Gottlob, and T. Lukasiewicz, A general Datalog-based framework for tractable query answering over ontologies, J. Web Sem, vol.14, pp.57-83, 2012.

A. Caì-i, G. Gottlob, and A. Pieris, Towards more expressive ontology languages: The query answering problem, Artif. Intell, vol.193, pp.87-128, 2012.

D. Calvanese, G. De-giacomo, D. Lembo, M. Lenzerini, and R. Rosati, Data complexity of query answering in description logics, Artificial Intelligence, vol.195, pp.335-360, 2013.
DOI : 10.1016/j.artint.2012.10.003

C. Chekuri and A. Rajaraman, Conjunctive query containment revisited, Theoretical Computer Science, vol.239, issue.2, pp.211-229, 2000.
DOI : 10.1016/S0304-3975(99)00220-0
URL : http://doi.org/10.1016/s0304-3975(99)00220-0

A. Deutsch and V. Tannen, Reformulation of XML Queries and Constraints, pp.225-241, 2003.
DOI : 10.1007/3-540-36285-1_15

R. Fagin, P. G. Kolaitis, R. J. Miller, and L. Popa, Data exchange: semantics and query answering, Theoretical Computer Science, vol.336, issue.1, pp.89-124, 2005.
DOI : 10.1016/j.tcs.2004.10.033
URL : http://doi.org/10.1016/j.tcs.2004.10.033

G. Gottlob, N. Leone, and F. Scarcello, The complexity of acyclic conjunctive queries, Journal of the ACM, vol.48, issue.3, pp.431-498, 2001.
DOI : 10.1145/382780.382783

G. Gottlob, N. Leone, and F. Scarcello, Hypertree Decompositions and Tractable Queries, Journal of Computer and System Sciences, vol.64, issue.3, pp.579-627, 2002.
DOI : 10.1006/jcss.2001.1809

G. Gottlob, N. Leone, and F. Scarcello, Robbers, marshals, and guards, Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '01, pp.775-808, 2003.
DOI : 10.1145/375551.375579

G. Gottlob, M. Manna, M. Morak, and A. Pieris, On the Complexity of Ontological Reasoning under Disjunctive Existential Rules, pp.1-18, 2012.
DOI : 10.1007/978-3-642-32589-2_1

G. Gottlob, M. Manna, and A. Pieris, Abstract, Theory and Practice of Logic Programming, vol.13, issue.4-5, pp.877-892, 2013.
DOI : 10.1145/962446.962450

E. Grädel, Abstract, The Journal of Symbolic Logic, vol.88, issue.04, pp.1719-1742, 1999.
DOI : 10.1137/0206033

B. C. 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. Intell. Res, vol.47, pp.741-808, 2013.

M. Krötzsch and S. Rudolph, Extending decidable existential rules by joining acyclicity and guardedness, In: IJCAI. pp, pp.963-968, 2011.

N. Leone, M. Manna, G. Terracina, and P. Veltri, Efficiently computable Datalog ? programs, p.KR, 2012.

P. F. Patel-schneider and I. Horrocks, A comparison of two modelling paradigms in the Semantic Web, Web Semantics: Science, Services and Agents on the World Wide Web, vol.5, issue.4, pp.240-250, 2007.
DOI : 10.1016/j.websem.2007.09.004