Beyersdorff, O orcid.org/0000-0002-2870-1648 and Blinkhorn, J (2018) Genuine Lower Bounds for QBF Expansion. In: Niedermeier, R and Vallee, B, (eds.) Leibniz International Proceedings in Informatics (LIPIcs). 35th Symposium on Theoretical Aspects of Computer Science (STACS 2018), 28 Feb - 03 Mar 2018, Caen, France. Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik , 12:1-12:15. ISBN 978-3-95977-062-0
Abstract
We propose the first general technique for proving genuine lower bounds in expansion-based QBF proof systems. We present the technique in a framework centred on natural properties of winning strategies in the 'evaluation game' interpretation of QBF semantics. As applications, we prove an exponential proof-size lower bound for a whole class of formula families, and demonstrate the power of our approach over existing methods by providing alternative short proofs of two known hardness results. We also use our technique to deduce a result with manifest practical import: in the absence of propositional hardness, formulas separating the two major QBF expansion systems must have unbounded quantifier alternations.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | (c) Olaf Beyersdorff and Joshua Blinkhorn; licensed under Creative Commons License CC-BY |
Keywords: | QBF, proof complexity, lower-bound techniques, resolution |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) |
Funding Information: | Funder Grant number John Templeton Foundation (US) 60842 |
Depositing User: | Symplectic Publications |
Date Deposited: | 03 Jan 2018 12:38 |
Last Modified: | 23 Jun 2023 22:41 |
Published Version: | https://stacs2018.sciencesconf.org/resource/page/i... |
Status: | Published |
Publisher: | Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik |
Identification Number: | 10.4230/LIPIcs.STACS.2018.12 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:125534 |