36 search results - page 8 / 8 » Proof Complexity of Propositional Default Logic |
CADE
1998
Springer
13 years 8 months ago
1998
Springer
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...