论文信息 - The Complexity of Propositional Tense Logics

The Complexity of Propositional Tense Logics

In [4], Ladner investigated the complexity of the provability problems for modal logics. In particular, he showed that provability in all modal logics between K and S4 is PSPACE-hard, and he constructed polynomial space bounded algorithms for deciding provability in K, T, and S4, which implies that the provability problems for these logics are PSPACE-complete.

Edith Spaan

[1] Richard E. Ladner,et al. The Computational Complexity of Provability in Systems of Modal Propositional Logic , 1977, SIAM J. Comput..

[2] A. Nakamura,et al. On the size of refutation Kripke models for some linear modal and tense logics , 1980 .

[3] Joseph Y. Halpern,et al. A Guide to the Modal Logics of Knowledge and Belief: Preliminary Draft , 1985, IJCAI.

[4] A. P. Sistla,et al. The complexity of propositional linear temporal logics , 1985, JACM.

[5] Joseph Y. Halpern,et al. The Complexity of Reasoning about Knowledge and Time. I. Lower Bounds , 1989, J. Comput. Syst. Sci..

[6] Johan van Benthem,et al. The logic of time - a model-theoretic investigation into the varieties of temporal ontology and temporal discourse, 2nd Edition , 1982, Synthese library.