Sciweavers

AAAI
2010
13 years 9 months ago
Exploiting QBF Duality on a Circuit Representation
Search based solvers for Quantified Boolean Formulas (QBF) have adapted the SAT solver techniques of unit propagation and clause learning to prune falsifying assignments. The tech...
Alexandra Goultiaeva, Fahiem Bacchus
SAT
2010
Springer
132views Hardware» more  SAT 2010»
13 years 10 months ago
Exploiting Circuit Representations in QBF Solving
Previous work has shown that circuit representations can be exploited in QBF solvers to obtain useful performance improvements. In this paper we examine some additional techniques ...
Alexandra Goultiaeva, Fahiem Bacchus
SAT
2009
Springer
158views Hardware» more  SAT 2009»
14 years 6 months ago
Beyond CNF: A Circuit-Based QBF Solver
State-of-the-art solvers for Quantified Boolean Formulas (QBF) have employed many techniques from the field of Boolean Satisfiability (SAT) including the use of Conjunctive Norm...
Alexandra Goultiaeva, Vicki Iverson, Fahiem Bacchu...