Bibliography

1

D. Basin, S. Matthews, and L. Viganò.
A new method for bounding the complexity of modal logics.
In G. Gottlob, A. Leitsch, and D. Mundici, editors, Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory (KGC'97), LNCS 1289, pages 89-102. Springer, 1997.

2

D. Basin, S. Matthews, and L. Viganò.
Complexity Bounds for Propositional Modal Logics.
Technical Report, Institut für Informatik, Albert-Ludwigs-Universität Freiburg, Germany. To appear. Available at http://www.informatik.uni-freiburg.de/~ luca, 1999.

3

C.C. Chen and I.P. Lin.
The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics.
Theoretical Computer Science, 129:95-121, 1994.

4

L. Fariñas del Cerro and M. Penttonen.
A note on the complexity of the satisfiability of modal Horn clauses.
Logic Programming, 4:1-10, 1987.

5

R. Goré.
Tableau Methods for Modal and Temporal Logics.
Technical Report TR-ARP-15-95, Australian National University, Available via http://arp.anu.edu.au on WWW, 1995.

6

K.J.J. Hintikka.
Form and content in quantification theory.
Acta Philosophica Fennica, 8:3-55, 1955.

7

J. Hudelmaier.
A contraction-free sequent calculus for S4.
In H. Wansing, editor, Proof Theory of Modal Logic, pages 3-15. Kluwer, Dordrecht, 1996.

8

J. Hudelmaier.
Improved decision procedures for the modal logics K, T, S4.
In H. Kleine Büning, editor, Proceedings of CLS'95, LNCS 1092, pages 320-334. Springer, 1996.

9

S.A. Kripke.
Semantical analysis of modal logic, I. normal modal propositional calculus.
Z. Math. Logic Grundlag, 9:67-96, 1963.

10

R. Ladner.
The computational complexity of provability in systems of modal propositional logic.
SIAM Journal of Computing, 6:467-480, 1977.

11

W. Rautenberg.
Modal tableau calculi and interpolation.
Journal of Philosophical Logic, 12:403-423, 1983.

12

L. Viganò.
A framework for non-classical logics.
PhD thesis, Universität des Saarlandes, Saabrücken, Germany, 1997.