Beyersdorff, O orcid.org/0000-0002-2870-1648, Chew, L and Sreenivasaiah, K (2015) A game characterisation of tree-like Q-resolution size. In: Dediou, A-H, Formenti, E, Martín-Vide, C and Truthe, B, (eds.) Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics. LATA'15, 02-06 Mar 2015, Nice, France. Springer , pp. 486-498. ISBN 978-3-319-15579-1
Abstract
We provide a characterisation for the size of proofs in treelike Q-Resolution by a Prover-Delayer game, which is inspired by a similar characterisation for the proof size in classical tree-like Resolution [10]. This gives the first successful transfer of one of the lower bound techniques for classical proof systems to QBF proof systems. We confirm our technique with two previously known hard examples. In particular, we give a proof of the hardness of the formulas of Kleine Büning et al. [20] for tree-like Q-Resolution.
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | © 2015, Springer. This is an author produced version of a paper published in Lecture Notes in Computer Science. Uploaded in accordance with the publisher's self-archiving policy. |
Keywords: | Conjunctive Normal Form; Partial Assignment; Universal Variable; Conjunctive Normal Form Formula; Empty Clause |
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: | 13 Sep 2019 13:33 |
Last Modified: | 13 Sep 2019 13:35 |
Status: | Published |
Publisher: | Springer |
Identification Number: | 10.1007/978-3-319-15579-1_38 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:85649 |