4 citations · 7 across the 3 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.LO2018
Expansion-Based QBF Solving Without Recursion
Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic +3
In recent years, expansion-based techniques have been shown to be very powerful in theory and practice for solving quantified Boolean formulas (QBF), the extension of propositional…
cs.LO2018
Short Proofs for Some Symmetric Quantified Boolean Formulas
Manuel Kauers, Martina Seidl
We exploit symmetries to give short proofs for two prominent formula families of QBF proof complexity. On the one hand, we employ symmetry breakers. On the other hand, we enrich th…
cs.LO2018
Symmetries of Quantified Boolean Formulas
Manuel Kauers, Martina Seidl
While symmetries are well understood for Boolean formulas and successfully exploited in practical SAT solving, less is known about symmetries in quantified Boolean formulas (QBF).…