Beyersdorff, O, Chew, L, Mahajan, M et al. (1 more author) (2018) Understanding cutting planes for QBFs. Information and Computation, 262 (1). pp. 141-161. ISSN 0890-5401
Abstract
We study the cutting planes system CP+∀red for quantified Boolean formulas (QBF), obtained by augmenting propositional Cutting Planes with a universal reduction rule, 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 expansion-based QBF resolution system ∀Exp+Res. A similar picture holds for a semantic version semCP+∀red.
Technically, our results establish the effectiveness of two lower bound techniques for CP+∀red: via strategy extraction and via monotone feasible interpolation.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2018 Elsevier Inc. This is an author produced version of a paper published in Information and Computation. Uploaded in accordance with the publisher's self-archiving policy. |
Keywords: | Proof complexity; Quantified Boolean formulas; Cutting; Planes; Resolution; Frege proofs |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 27 Jun 2019 12:50 |
Last Modified: | 14 Aug 2019 00:44 |
Status: | Published |
Publisher: | Elsevier Inc. |
Identification Number: | 10.1016/j.ic.2018.08.002 |
Related URLs: | |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:147855 |