Satisfiability for the modal logics K4×S5, S4×S5, and SSL is shown decidable in ESPACE, completing the proof of EXPSPACE-completeness.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
EXPSPACE-Completeness of the Logics K4xS5 and S4xS5 and the Logic of Subset Spaces, Part 1: ESPACE-Algorithms
Satisfiability for the modal logics K4×S5, S4×S5, and SSL is shown decidable in ESPACE, completing the proof of EXPSPACE-completeness.