D. Abiteboul, O. M. Abiteboul, and . Duschka, Complexity of answering queries using materialized views, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems , PODS '98, 1998.
DOI : 10.1145/275487.275516
URL : https://hal.archives-ouvertes.fr/hal-00802873

. Abiteboul, Serge Abiteboul, Richard Hull, and Victor Vianu. Foundations of Databases, 1995.

. Afrati, Data exchange in the presence of arithmetic comparisons, Proceedings of the 11th international conference on Extending database technology Advances in database technology, EDBT '08, 2008.
DOI : 10.1145/1353343.1353403

. Andréka, Hajnal Andréka, István Németi, and Johan van Benthem. Modal languages and bounded fragments of predicate logic, J. Philosophical Logic, vol.27, issue.3, 1998.

. Baget, Jean-François Baget, MichelLecì ere, Marie-Laure Mugnier, and Eric Salvat. Extending decidable cases for rules with existential variables, IJCAI, 2009.

. Baget, Walking the complexity lines for generalized guarded existential rules, IJCAI, 2011.
URL : https://hal.archives-ouvertes.fr/lirmm-00618081

. Baget, Combining existential rules and transitivity: Next steps, IJCAI, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01171846

B. Bárány, V. Bárány, and M. Boja´nczykboja´nczyk, Finite satisfiability for guarded fixpoint logic, Information Processing Letters, vol.112, issue.10, pp.371-375, 2012.
DOI : 10.1016/j.ipl.2012.02.005

. Bárány, Vince Bárány, Balder ten Cate, and Luc Segoufin. Guarded negation, ICALP, 2011.

. Bárány, Balder ten Cate, and Martin Otto. Queries with guarded negation, pp.1328-1339, 2012.

. Benedikt, Michael Benedikt, Pierre Bourhis, and Michael Vanden Boom. A step up in expressiveness of decidable fixpoint logics, LICS, 2016.

. Bourhis, Pierre Bourhis, Michael Morak, and Andreas Pieris. The impact of disjunction on query answering under guarded-based existential rules, IJCAI, 2013.

. Bourhis, Reasonable highly expressive query languages, IJCAI, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01211282

. Calvanese, Decidable containment of recursive queries, Theoretical Computer Science, vol.336, issue.1, pp.33-56, 2005.
DOI : 10.1016/j.tcs.2004.10.031
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.144.4785

. Calvanese, Data complexity of query answering in description logics, KR, 2006.
DOI : 10.1016/j.artint.2012.10.003

. Calvanese, Regular path queries in expressive description logics with nominals, IJCAI, 2009.
DOI : 10.1016/j.ic.2014.04.002
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.155.3342

J. Emerson, C. S. Emerson, and . Jutla, The complexity of tree automata and logics of programs (Extended abstract), FOCS, 1988.

. Ganzinger, Harald Ganzinger, Christoph Meyer, and Margus Veanes. The two-variable guarded fragment with transitive relations, LICS, 1999.

P. Gottlob, C. Gottlob, and . Papadimitriou, On the complexity of single-rule datalog queries, Inf. Comp, vol.183, 2003.

. Gottlob, Georg Gottlob, Andreas Pieris, and Lidia Tendera. Querying the guarded fragment with transitivity, ICALP, 2013.

W. Grädel, Erich Grädel and Igor Walukiewicz. Guarded fixed point logic, LICS, 1999.

. Gutiérrez-basulto, Conjunctive Queries with Negation over DL-Lite: A Closer Look, Web Reasoning and Rule Systems, 2013.
DOI : 10.1007/978-3-642-39666-3_9

S. Horrocks, U. Horrocks, and . Sattler, A description logic with transitive and inverse roles and role hierarchies, Journal of Logic and Computation, vol.9, issue.3, pp.385-410, 1999.
DOI : 10.1093/logcom/9.3.385
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.164.8715

]. Kieronski, Decidability issues for two-variable logics with several linear orders, CSL, 2011.

R. M. Krötzsch, S. Krötzsch, and . Rudolph, Conjunctive queries for EL with role composition, DL, 2007.

C. Löding, Automata on infinite trees, 2011.

M. Ortiz and M. Simkus, Reasoning and query answering in description logics. Reasoning Web. Semantic Technologies for Advanced Query Answering, pp.1-53, 2012.
DOI : 10.1007/978-3-642-33158-9_1

. Ortiz, Query answering is undecidable in DLs with regular expressions, inverses, nominals, and counting, 2010.

. Ortiz, Query answering in the Horn fragments of the description logics SHOIQ and SROIQ Query answering in expressive description logics Two variable first-order logic over ordered domains Sur l'extension de l'ordre partiel Wies?aw Szwast and Lidia Tendera . The guarded fragment with transitive guards, IJCAISzwast and Tendera Languages, Automata, and Logic Handbook of Formal Languages Vardi. Reasoning about the past with two-way automata ICALP, pp.685-702386, 1930.