Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L and Sreenivasaiah, K (2019) A game characterisation of tree-like Q-Resolution size. Journal of Computer and System Sciences, 104. pp. 82-101. ISSN 0022-0000
Abstract
We provide a characterisation for the size of proofs in tree-like Q-Resolution and tree-like QU-Resolution by a Prover–Delayer game, which is inspired by a similar characterisation for the proof size in classical tree-like Resolution. This gives one of the first successful transfers of one of the lower bound techniques for classical proof systems to QBF proof systems. We apply our technique to show the hardness of three classes of formulas for tree-like Q-Resolution. In particular, we give a proof of the hardness of the parity formulas from Beyersdorff et al. (2015) for tree-like Q-Resolution and of the formulas of Kleine Büning et al. (1995) for tree-like QU-Resolution.
Metadata
Item Type: | Article |
---|---|
Authors/Creators: |
|
Copyright, Publisher and Additional Information: | © 2017 The Authors. Published by Elsevier Inc. This is an open access article under the terms of the Creative Commons Attribution 4.0 International (CC BY 4.0) (https://creativecommons.org/licenses/by/4.0/) |
Keywords: | Proof complexity; Resolution; Prover–Delayer games; QBF |
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 EPSRC EP/L024233/1 John Templeton Foundation - DO NOT USE 48138 EU - European Union 612638 |
Depositing User: | Symplectic Publications |
Date Deposited: | 05 Dec 2016 12:08 |
Last Modified: | 19 Jun 2019 20:19 |
Published Version: | https://doi.org/10.1016/j.jcss.2016.11.011 |
Status: | Published |
Publisher: | Elsevier |
Identification Number: | 10.1016/j.jcss.2016.11.011 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:108954 |