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.1090/coll/041

B. Vince, M. Benedikt, and P. Bourhis, Access patterns and integrity constraints revisited, Intl. Conf. on Database Theory (ICDT), 2013.

B. Vince, M. Benedikt, and C. Balder-ten, Rewriting Guarded Negation Queries, 2013.

B. Vince and M. Bojá-nczyk, Finite satisfiability for guarded fixpoint logic, Inform. Process, 2012.

B. Vince, M. Balder-ten-cate, and . Otto, Queries with Guarded Negation, Intl. Conf. on Very Large Databases (VLDB), 2012.

B. Vince, Balder ten Cate, and Luc Segoufin. 2015. Guarded Negation, J. ACM, vol.62, issue.22, pp.1-22, 2015.

M. Benedikt, P. Bourhis, and M. V. Boom, A Step Up in Expressiveness of Decidable Fixpoint Logics, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16, pp.817-826, 2016.
DOI : 10.1007/BFb0055090
URL : https://hal.archives-ouvertes.fr/hal-01413890

M. Benedikt, M. V. Balder-ten-cate, and . Boom, Interpolation with Decidable Fixpoint Logics, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science, pp.378-389, 2015.
DOI : 10.1109/LICS.2015.43

M. Benedikt, M. V. Balder-ten-cate, and . Boom, Effective Interpolation and Preservation in Guarded Logics, ACM Trans. Computational Logic, vol.17, issue.8, pp.1-8, 2016.

D. Berwanger and E. Grädelgr¨grädel, Games and Model Checking for Guarded Logics, Logic for Programming, Artificial Intelligence, and Reasoning (LPAR), pp.70-84, 2001.
DOI : 10.1007/3-540-45653-8_5

M. Bienvenu, C. Balder-ten-cate, F. Lutz, and . Wolter, Ontology-Based Data Access, ACM Transactions on Database Systems, vol.39, issue.4, pp.1-3344, 2014.
DOI : 10.2168/LMCS-8(1:12)2012
URL : https://hal.archives-ouvertes.fr/lirmm-01367812

M. Bojá-nczyk, The finite graph problem for two-way alternating automata, Theoretical Computer Science, vol.3, issue.298, pp.511-528, 2003.

P. Bourhis, M. Manna, M. Morak, and A. Pieris, Guarded-Based Disjunctive Tuple-Generating Dependencies, ACM Transactions on Database Systems, vol.41, issue.4, pp.1-2745, 2016.
DOI : 10.1145/28659.28660

P. Bourhis, M. Morak, and A. Pieris, Acyclic Query Answering under Guarded Disjunctive Existential Rules and Consequences to DLs, Intl. Workshop on Description Logics, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01098983

B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Information and Computation, vol.85, issue.1, pp.12-75, 1990.
DOI : 10.1016/0890-5401(90)90043-H
URL : https://hal.archives-ouvertes.fr/hal-00353765

T. Gogacz and J. Marcinkowski, Red Spider Meets a Rainworm, Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS '16, 2016.
DOI : 10.1145/1142351.1142404

E. Grädelgr¨grädel, Why are Modal Logics so Robustly Decidable? In Current Trends in Theoretical Computer Science, pp.393-408, 2001.

E. Grädelgr¨grädel, C. Hirsch, and M. Otto, Back and forth between guarded and modal logics, ACM Transactions on Computational Logic, vol.3, issue.3, pp.418-463, 2002.
DOI : 10.1145/507382.507388

E. Grädelgr¨grädel, M. Otto, and E. Rosen, Undecidability results on two-variable logics, Archive for Mathematical Logic, vol.38, pp.4-5, 1999.

E. Grädelgr¨grädel and I. Walukiewicz, Guarded Fixed Point Logic, Symp. on Logic In Computer Science (LICS), 1999.

E. Hoogland, M. Marx, and M. Otto, Beth Definability for the Guarded Fragment, Logic Programming and Automated Reasoning (LPAR), 1999.
DOI : 10.1007/3-540-48242-3_17

D. Janin and I. Walukiewicz, On the Expressive Completeness of the Propositional µ-Calculus w.r.t. Monadic Second-Order Logic, Intl. Conf. on Concurrency Theory (CONCUR), 1996.

M. Marx and M. De-rijke, Semantic characterizations of navigational XPath, ACM SIGMOD Record, vol.34, issue.2, pp.41-46, 2005.
DOI : 10.1145/1083784.1083792

M. Mortimer, On languages with two variables Zeitschrift f ¨ ur mathematische Logik und Grundlagen der, Mathematik, vol.21, issue.8, pp.135-140, 1975.

A. Nash, L. Segoufin, and V. Vianu, Views and queries, ACM Transactions on Database Systems, vol.35, issue.3, pp.1-2141, 2010.
DOI : 10.1145/1806907.1806913

M. Otto, Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment, Symp. on Logic In Computer Science (LICS), 2010.

M. Otto, Expressive completeness through logically tractable models, Annals of Pure and Applied Logic, vol.164, issue.12, pp.1418-1453, 2013.
DOI : 10.1016/j.apal.2013.06.017

E. Rosen, Modal logic over finite structures, Journal of Logic, Language and Information, vol.6, issue.4, pp.427-439, 1997.
DOI : 10.1023/A:1008275906015

C. Balder-ten and L. Segoufin, Unary negation, Logical Methods in Computer Science (LMCS), vol.9, 2013.

C. Balder-ten and L. Segoufin, Craig Interpolation for bounded variable fragments of guarded negation, 2015.

J. Van-benthem, Modal Logic and Classical Logic, Bibliopolis, 1983.

M. Y. Vardi, Why is modal logic so robustly decidable?, Descriptive Complexity and Finite Models, pp.149-184, 1996.
DOI : 10.1090/dimacs/031/05

M. Y. Vardi, Reasoning about the past with two-way automata, Intl. Colloquium on Automata, Languages and Programming (ICALP), 1998.
DOI : 10.1007/BFb0055090

K. W. Wagner, More Complicated Questions about Maxima and Minima, and some Closures of NP, Theoretical Computer Science, vol.51, pp.1-2, 1987.