P. Balsiger, A. Heuerding, and S. Schwendimann, A Benchmark Method for the Propositional Modal Logics K, KT, S4, JAR, vol.24, issue.3, pp.297-317, 2000.

B. F. Chellas, Modal Logic: An Introduction, 1980.

S. A. Cook, Characterizations of Pushdown Machines in Terms of Time-Bounded Computers, Journal of ACM, vol.18, issue.1, pp.4-18, 1971.

J. Lagniez, D. Berre, T. De-lima, and V. Montmirail, A Recursive Shortcut for CEGAR: Application To The Modal Logic K Satisfiability Problem, Proc. of IJCAI'17, 2017.
URL : https://hal.archives-ouvertes.fr/hal-02271412

L. A. Nguyen, A New Space Bound for the Modal Logics K4, KD4 and S4, Proc. of MFCS'99, pp.321-331, 1999.

H. Sahlqvist, Completeness and correspondence in the first and second order semantics for modal logic, Proc. of the 3rd Scandinavian Logic Sumposium, 1973.

R. Sebastiani and D. Mcallester, New Upper Bounds for Satisfiability in Modal Logics the Case-study of Modal K, 1997.