On the complexity of epistemic reasoning
Proceedings of the Fourth Annual Symposium on Logic in computer science
A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Journal of the ACM (JACM)
A New Space Bound for the Modal Logics K4, KD4 and S4
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Improved Decision Procedures for the Modal Logics K, T, and S4
CSL '95 Selected Papers from the9th International Workshop on Computer Science Logic
A New Method for Bounding the Complexity of Modal Logics
KGC '97 Proceedings of the 5th Kurt Gödel Colloquium on Computational Logic and Proof Theory
On determinism versus non-determinism and related problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
On determinism versus non-determinism and related problems
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Hierarchies of memory limited computations
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
| Hi-index | 0.01 |
In recent years, there has been a lot of interest in analyzing the space requirements for modal logics. In this paper, we prove that modal satisfiability is in deterministic linear space. This improves the best previously-known O(n log n) bound and it is the first linear space result in this area.