Sciweavers

3 search results - page 1 / 1
» A Benchmark Method for the Propositional Modal Logics K, KT,...
Sort
View
JAR
2000
137views more  JAR 2000»
13 years 4 months ago
A Benchmark Method for the Propositional Modal Logics K, KT, S4
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 ...
Peter Balsiger, Alain Heuerding, Stefan Schwendima...
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é
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...