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.2307/2275853

A. Arnold and D. Niwinski, Rudiments of mu-calculus, 2001.

V. Bárány, L. Balder-ten-cate, and . Segoufin, Guarded negation, J. ACM, vol.62, issue.3

V. Bárány, G. Gottlob, and M. Otto, Querying the guarded fragment, LMCS, pp.10-2168, 2014.

V. Bárány, L. Balder-ten-cate, and . Segoufin, Guarded negation, ICALP, 2011.

P. Barceló, G. Gottlob, and A. Pieris, Semantic Acyclicity Under Constraints, Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, PODS '16
DOI : 10.1006/jcss.1999.1626

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
DOI : 10.1007/BFb0055090
URL : https://hal.archives-ouvertes.fr/hal-01413890

M. Benedikt, T. Balder-ten-cate, M. V. Colcombet, and . Boom, The Complexity of Boundedness for Guarded Logics, 2015 30th Annual ACM/IEEE Symposium on Logic in Computer Science
DOI : 10.1109/LICS.2015.36

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
DOI : 10.1109/LICS.2015.43

A. Blumensath, M. Otto, and M. Weyer, Decidability Results for the Boundedness Problem, Logical Methods in Computer Science, vol.10, issue.3
DOI : 10.2168/LMCS-10(3:2)2014
URL : https://lmcs.episciences.org/1225/pdf

D. Giovanna, M. Agostino, and . Hollenberg, Logical Questions Concerning The mu- Calculus: Interpolation, Lyndon and Los-Tarski. The Journal of Symbolic Logic, pp.310-33210, 2000.

D. Giovanna, G. Agostino, and . Lenzi, Bisimulation quantifiers and uniform interpolation for guarded first order logic, Theor. Comput. Sci, vol.563, pp.75-85

D. Figueira, Semantically Acyclic Conjunctive Queries under Functional Dependencies, Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, LICS '16
DOI : 10.1016/0020-0190(89)90205-6

G. Gottlob, E. Grädel, and H. Veith, Datalog LITE: a deductive query language with linear time model checking, ACM Transactions on Computational Logic, vol.3, issue.1, pp.42-7910, 2002.
DOI : 10.1145/504077.504079
URL : http://www-mgi.informatik.rwth-aachen.de/Publications/pub/graedel/GoGrVe-tocl02.ps

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-80810, 2003.
DOI : 10.1145/375551.375579

E. 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ä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

E. Hoogland, M. Marx, and M. Otto, Beth Definability for the Guarded Fragment, LPAR, pp.10-1007, 1999.
DOI : 10.1007/3-540-48242-3_17

D. Janin and I. Walukiewicz, Automata for the modal mu-calculus and related results, MFCS, 1995.
DOI : 10.1007/3-540-60246-1_160

D. Janin and I. Walukiewicz, On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic, In CONCUR, 1996.
DOI : 10.1007/3-540-61604-7_60

M. Otto, Eliminating recursion in the µ-calculus, STACS, 1999.

L. Balder-ten-cate and . Segoufin, Unary negation, STACS, 2011.

F. A. Van-benthem, Modal Logic and Classical Logic, Humanities Pr, 1983.

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