135 search results - page 2 / 27 » A Distributed Algorithm to Evaluate Quantified Boolean Formu... |
SAT
2005
Springer
13 years 10 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
MSV
2004
13 years 6 months ago
2004
A large number of applications can be represented by quantified Boolean formulas (QBF). Although evaluating QBF is NP-hard and thus very difficult, there has been significant progr...
ADBIS
2004
Springer
13 years 8 months ago
2004
Springer
Abstract. We present for the first-order theory of atomic Boolean algebras of sets with linear cardinality constraints a quantifier elimination algorithm. In the case of atomic Boo...
JAR
2006
13 years 4 months ago
2006
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
STOC
1987
ACM
13 years 8 months ago
1987
ACM
The Boolean formula value problem is in alternating log time and, more generally, parenthesis context-free languages are in alternating log time. The evaluation of reverse Polish ...