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. Arnold and D. Niwinski, Rudiments of mu-calculus, 2001.

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

V. Bárány, M. Benedikt, and C. Balder-ten, Rewriting guarded negation queries, Intl. Symp. on Mathematical Foundations of Computer Science (MFCS), 2013.

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

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

V. Bárány, G. Gottlob, and M. Otto, Querying the guarded fragment, 2014. Preliminary version in Proc. Symp. on Logic In Computer Science (LICS), 2010.

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

M. Bienvenu, C. Balder-ten-cate, F. Lutz, and . Wolter, Ontology-based data access: a study through disjunctive datalog, csp, and mmsnp, Symp. on Principles of Database Systems (PODS), 2013.
DOI : 10.1145/2661643

URL : https://hal.archives-ouvertes.fr/hal-01117583

V. Bárány, L. Balder-ten-cate, and . Segoufin, Guarded Negation, International Conference on Automata, Languages and Programming (ICALP), pp.356-367, 2011.
DOI : 10.1002/malq.19750210118

V. Bárány, M. Balder-ten-cate, and . Otto, Queries with guarded negation, Intl. Conf. on Very Large Databases (VLDB), 2012.

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

A. Dawar and Y. Gurevich, Fixed Point Logics, Bulletin of Symbolic Logic, vol.8, issue.1, pp.65-88, 2002.
DOI : 10.2178/bsl/1182353853

J. Flum, M. Frick, and M. Grohe, Query evaluation via tree-decompositions, Journal of the ACM, vol.49, issue.6, pp.716-752, 2002.
DOI : 10.1145/602220.602222

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

E. Grädel, M. Otto, and E. Rosen, Undecidability results on two-variable logics, Arch. Math. Log, vol.38, issue.4-5, pp.313-354, 1999.

G. Gottlob and C. H. Papadimitriou, On the complexity of single-rule datalog queries, Information and Computation, vol.183, issue.1, pp.104-122, 2003.
DOI : 10.1016/S0890-5401(03)00012-9

E. Gr and . Grädel, Decision procedures for guarded logics, Intl. Conf. on Automated Deduction (CADE), 1999.

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

[. Grädel, Why are modal logics so robustly decidable? In Current Trends in Theoretical Computer Science, pp.393-408, 2001.

E. Grädel and I. Walukiewicz, Guarded fixed point logic, Proceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158), 1999.
DOI : 10.1109/LICS.1999.782585

]. W. Hod93 and . Hodges, Model Theory, 1993.

I. Hodkinson, Loosely guarded fragment of first-order logic has the finite model property, Studia Logica, vol.70, issue.2, pp.205-240, 2002.
DOI : 10.1023/A:1015178417181

M. Marx, Tolerance logic, Journal of Logic, Language and Information, vol.10, 1999.

M. Mortimer, On languages with two variables, Mathematical Logic Quarterly, vol.27, issue.1, pp.135-140, 1975.
DOI : 10.1002/malq.19750210118

M. Otto, Modal and guarded characterisation theorems over finite transition systems, Annals of Pure and Applied Logic, vol.130, issue.1-3, pp.173-205, 2004.
DOI : 10.1016/j.apal.2004.04.003

URL : http://doi.org/10.1016/j.apal.2004.04.003

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

Y. Moshe and . Vardi-johan-van-benthem, Why is modal logic so robustly decidable? In Descriptive Complexity and Finite Models Dynamic bits and pieces, pp.149-184, 1996.