Sciweavers

5 search results - page 1 / 1
» Improved Decision Procedures for the Modal Logics K, T, and ...
Sort
View
CSL
1995
Springer
13 years 8 months ago
Improved Decision Procedures for the Modal Logics K, T, and S4
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...
Jörg Hudelmaier
MFCS
1999
Springer
13 years 9 months ago
A New Space Bound for the Modal Logics K4, KD4 and S4
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...
Linh Anh Nguyen
AIML
1998
13 years 6 months ago
A Resolution-Based Decision Procedure for Extensions of K4
Abstract. This paper presents a resolution decision procedure for transitive propositional modal logics. The procedure combines the relational translation method with an ordered ch...
Harald Ganzinger, Ullrich Hustadt, Christoph Meyer...
CADE
1998
Springer
13 years 9 months ago
System Description: leanK 2.0
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
Bernhard Beckert, Rajeev Goré
LICS
2012
IEEE
11 years 7 months ago
Countermodels from Sequent Calculi in Multi-Modal Logics
—A novel countermodel-producing decision procedure that applies to several multi-modal logics, both intuitionistic and classical, is presented. Based on backwards search in label...
Deepak Garg, Valerio Genovese, Sara Negri