Sciweavers

SAT
2010
Springer
136views Hardware» more  SAT 2010»
14 years 8 months ago
A Non-prenex, Non-clausal QBF Solver with Game-State Learning
Abstract. We describe a DPLL-based solver for the problem of quantified boolean formulas (QBF) in non-prenex, non-CNF form. We make two contributions. First, we reformulate clause...
William Klieber, Samir Sapra, Sicun Gao, Edmund M....
SAT
2004
Springer
75views Hardware» more  SAT 2004»
14 years 10 months ago
The Second QBF Solvers Comparative Evaluation
This paper reports about the 2004 comparative evaluation of solvers for quantified Boolean formulas (QBFs), the second in a series of non-competitive events established with the a...
Daniel Le Berre, Massimo Narizzano, Laurent Simon,...
SAT
2009
Springer
158views Hardware» more  SAT 2009»
14 years 11 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...