7 papers:
SAT-2015-LonsingE #api #incremental #satisfiability- Incrementally Computing Minimal Unsatisfiable Cores of QBFs via a Clause Group Solver API (FL, UE), pp. 191–198.
- SAT-2012-Egly #on the
- On Sequent Systems and Resolution for QBFs (UE), pp. 100–113.
- SAT-2010-GiunchigliaMN #effectiveness #equivalence #named #preprocessor #reasoning
- sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning (EG, PM, MN), pp. 85–98.
- SAT-2009-LonsingB #dependence #representation
- A Compact Representation for Syntactic Dependencies in QBFs (FL, AB), pp. 398–411.
DATE-2006-GiunchigliaNT #quantifier- Quantifier structure in search based procedures for QBFs (EG, MN, AT), pp. 812–817.
CADE-2005-Benedetti #named- sKizzo: A Suite to Evaluate and Certify QBFs (MB), pp. 369–376.
- SAT-2005-Benedetti #quantifier
- Quantifier Trees for QBFs (MB), pp. 378–385.
