52 search results - page 6 / 11 » Encoding Quantified CSPs as Quantified Boolean Formulae |
80
Voted
MSV
2004
14 years 11 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...
67
Voted
IANDC
2006
14 years 9 months ago
2006
Many approaches to deciding the satisfiability of quantifier free formulae with respect to a background theory T -- also known as Satisfiability Modulo Theory, or SMT
SAT
2005
Springer
15 years 3 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...
107
click to vote
CAV
2004
Springer
15 years 1 months ago
2004
Springer
We study the problem of formally verifying shared memory multiprocessor executions against memory consistency models--an important step during post-silicon verification of multipro...
79
Voted
ECCC
2010
14 years 9 months ago
2010
The IP theorem, which asserts that IP = PSPACE (Lund et. al., and Shamir, in J. ACM 39(4)), is one of the major achievements of complexity theory. The known proofs of the theorem ...