DepQBF: A Dependency-Aware QBF Solver
Florian Lonsing, Armin Biere · Journal on Satisfiability Boolean Modeling and Computation · 2010
We present DepQBF 0.1, a new search-based solver for quantified boolean formulae (QBF). It integrates compact dependency graphs to overcome the restrictions imposed by linear quantifier prefixes of QBFs in prenex conjunctive normal form (PCNF). DepQB