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

C. Areces and B. Cate, Hybrid logics, Handbook of Modal Logics, pp.821-868, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00000307

C. Barrett, R. Sebastiani, S. A. Seshia, and C. Tinelli, Satisfiability modulo theories, Handbook of Satisfiability, pp.825-885, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01095009

F. L. Bauer and M. Wirsing, Elementare Aussagenlogik, 1991.
DOI : 10.1007/978-3-642-84263-4

P. Blackburn, M. De-rijke, and Y. Venema, Modal Logic, volume 53 of Cambridge Tracts in Theoretical Computer Science, 2001.

T. Bolander and P. Blackburn, Termination for Hybrid Tableaus, Journal of Logic and Computation, vol.17, issue.3, pp.517-554, 2007.
DOI : 10.1093/logcom/exm014

E. Börger, E. Grädel, and Y. Gurevich, The Classical Decision Problem, 1997.
DOI : 10.1007/978-3-642-59207-2

A. Chandra and P. Merlin, Optimal implementation of conjunctive queries in relational databases, Proc. 9th ACM Symp. Theory of Computing, pp.77-90, 1977.

A. Church, A note on the Entscheidungsproblem, The Journal of Symbolic Logic, vol.166, issue.01, pp.40-41, 1936.
DOI : 10.1007/BF01475439

H. Ganzinger, U. Hustadt, C. Meyer, and R. A. Schmidt, A resolution-based decision procedure for extensions of K4, Advances in Modal Logic, pp.225-246, 1998.

F. Giunchiglia and R. Sebastiani, Building Decision Procedures for Modal Logics from Propositional Decision Procedures: The Case Study of Modal K(m), Information and Computation, vol.162, issue.1-2, pp.158-178, 2000.
DOI : 10.1006/inco.1999.2850

V. Goranko and S. Passy, Using the Universal Modality: Gains and Questions, Journal of Logic and Computation, vol.2, issue.1, pp.5-30, 1992.
DOI : 10.1093/logcom/2.1.5

E. Grädel, P. Kolaitis, and M. Vardi, Abstract, Bulletin of Symbolic Logic, vol.40, issue.01, pp.53-69, 1997.
DOI : 10.1007/BF01449155

E. Grädel, M. Otto, and E. Rosen, Two-variable logic with counting is decidable, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.306-317, 1997.
DOI : 10.1109/LICS.1997.614957

U. Hustadt, H. De-nivelle, and R. A. Schmidt, Resolution-based methods for modal logics, Logic Journal of the IGPL, vol.8, issue.3, pp.265-292, 2000.

L. Löwenheim, ???ber M???glichkeiten im Relativkalk???l, Mathematische Annalen, vol.76, issue.4, pp.447-470, 1915.
DOI : 10.1007/BF01458217

R. Nieuwenhuis, A. Oliveras, and C. Tinelli, Solving SAT and SAT Modulo Theories, Journal of the ACM, vol.53, issue.6, pp.937-977, 2006.
DOI : 10.1145/1217856.1217859

H. J. Ohlbach and R. A. Schmidt, Functional translation and second-order frame properties of modal logics, Journal of Logic and Computation, vol.7, issue.5, pp.581-603, 1997.
DOI : 10.1093/logcom/7.5.581

L. Pacholsky, W. Szwast, and L. Tendera, Complexity of two-variable logic with counting, Proceedings of Twelfth Annual IEEE Symposium on Logic in Computer Science, pp.318-327, 1997.
DOI : 10.1109/LICS.1997.614958

R. A. Schmidt and U. Hustadt, First-Order Resolution Methods for Modal Logics, Programming Logics ? Essays in Memory of Harald Ganzinger, pp.345-391, 2013.
DOI : 10.1007/978-3-642-02959-2_20

R. A. Schmidt and D. Tishkovsky, Using tableau to decide description logics with full role negation and identity, ACM Transactions on Computational Logic, vol.15, issue.1, p.2014
DOI : 10.1145/2559947

D. Scott, A decision method for validity of sentences in two variables, Journal of Symbolic Logic, vol.27, issue.377, p.74, 1962.

R. Sebastiani and A. Tacchella, SAT techniques for modal and description logics, Handbook of Satisfiability, pp.781-824, 2009.

A. Turing, On computable numbers, with an application to the 'Entscheidungsproblem, Proc. London Mathematical Society 2nd. series, pp.230-265, 1937.

M. Vardi, Why is modal logic so robustly decidable?, DIMACS Ser. Disc. Math. Theoret. Comp. Sci, vol.31, pp.149-184, 1997.