Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



TR17-037 | 25th February 2017 10:51

Understanding Cutting Planes for QBFs



We define a cutting planes system CP+$\forall$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+$\forall$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 expansion-based QBF resolution system $\forall$Exp+Res. A similar picture holds for a semantic version semCP+$\forall$red.

Technically, our results establish the effectiveness of two lower bound techniques for CP+$\forall$red: via strategy extraction and via monotone feasible interpolation.

ISSN 1433-8092 | Imprint