610 search results - page 6 / 122 » Using SAT in QBF |
CAV
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we show how to do symbolic model checking using Boolean Expression Diagrams (BEDs), a non-canonical representation for Boolean formulas, instead of Binary Decision Di...
SPIN
2007
Springer
14 years 1 months ago
2007
Springer
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
DATE
2009
IEEE
14 years 2 months ago
2009
IEEE
—In this paper we present a procedure for solving quantified boolean formulas (QBF), which uses And-Inverter Graphs (AIGs) as the core data-structure. We make extensive use of s...
DATE
2010
IEEE
14 years 23 days ago
2010
IEEE
— Many CAD for VLSI problems can be naturally encoded as Quantified Boolean Formulas (QBFs) and solved with QBF solvers. Furthermore, such problems often contain circuitbased in...
ECAI
2004
Springer
13 years 11 months ago
2004
Springer
We introduce a uniform approach of representing a variety of paraconsistent non-monotonic formalisms by quantified Boolean formulae (QBFs) in the context of four-valued semantics. ...