A New Space Bound for the Modal Logics K4, KD4 and S4

Authors:
Linh Anh Nguyen
Affiliations:
-
Venue:
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Year:
1999

Citing 1
Cited 3

Gentzen-type systems and resolution rules. Part I. Propositional logic

COLOG '88 Proceedings of the International Conference on Computer Logic

Modal Satisfiability Is in Deterministic Linear Space

Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Clausal graph tableaux for hybrid logic with eventualities and difference

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Clausal Tableaux for Multimodal Logics of Belief

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose so called clausal tableau systems for the common modal logics K4, KD4 and S4. Basing on these systems, we give more efficient decision procedures than those hitherto known for the considered logics. In particular space requirements for our logics are reduced from the previously established bound O(n2.logn) to O(n.logn).