81 search results - page 2 / 17 » Approximations of Modal Logic K |
MFCS
1999
Springer
13 years 9 months ago
1999
Springer
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 kno...
CSL
1995
Springer
13 years 8 months ago
1995
Springer
We propose so called contraction free sequent calculi for the three prominent modal logics K, T, and S4. Deduction search in these calculi is shown to provide more efficient decisi...
JAR
2000
13 years 5 months ago
2000
A lot of methods have been proposed -- and sometimes implemented -- for proof search in the propositional modal logics K, KT, and S4. It is difficult to compare the usefulness of ...
JANCL
2006
13 years 5 months ago
2006
We describe BDD-based decision procedures for the modal logic K. Our approach is inspired by the automata-theoretic approach, but we avoid explicit automata construction. Instead, ...
CSL
1995
Springer
13 years 8 months ago
1995
Springer
