Understanding cutting planes for QBFs

Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla
2018 Information and Computation  
We define a cutting planes system CP+∀red for quantified Boolean formulas (QBF) and analyse the proof-theoretic strength of this new calculus. While in the propositional case, Cutting Planes is of intermediate strength between resolution and Frege, our findings here show that the situation in QBF is slightly more complex: while CP+∀red is again weaker than QBF Frege and stronger than the CDCL-based QBF resolution systems Q-Res and QU-Res, it turns out to be incomparable to even the weakest
more » ... sion-based QBF resolution system ∀Exp+Res. Technically, our results establish the effectiveness of two lower bound techniques for CP+∀red: via strategy extraction and via monotone feasible interpolation.
doi:10.1016/j.ic.2018.08.002 fatcat:v5qjxywoqnexldwvfwrvsrj4l4