38 search results - page 6 / 8 » Reducing signed propositional formulas |
LICS
2005
IEEE
14 years 3 months ago
2005
IEEE
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...
ATVA
2008
Springer
13 years 11 months ago
2008
Springer
Multi-valued Model Checking is an extension of classical, two-valued model checking with multi-valued logic. Multi-valuedness has been proved useful in expressing additional inform...
JANCL
2006
13 years 9 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, ...
CADE
1998
Springer
14 years 2 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...
VMCAI
2010
Springer
14 years 7 months ago
2010
Springer
Abstract. Techniques such as verification condition generation, preditraction, and expressive type systems reduce software verification to proving formulas in expressive logics. Pr...