Beyersdorff, O and Kullmann, O (2014) Unified characterisations of resolution hardness measures. In: Sinz, C and Egly, U, (eds.) Theory and Applications of Satisfiability Testing – SAT 2014 17th International Conference, Held as Part of the Vienna Summer of Logic, VSL 2014, Proceedings. 17th International Conference, Held as Part of the Vienna Summer of Logic, 14-17 Jul 2014, Vienna, Austria. Lecture Notes in Computer Science , 8561 L . Springer , 170 - 187.
Abstract
Various "hardness" measures have been studied for resolution, providing theoretical insight into the proof complexity of resolution and its fragments, as well as explanations for the hardness of instances in SAT solving. In this paper we aim at a unified view of a number of hardness measures, including different measures of width, space and size of resolution proofs. Our main contribution is a unified game-theoretic characterisation of these measures. As consequences we obtain new relations between the different hardness measures. In particular, we prove a generalised version of Atserias and Dalmau's result on the relation between resolution width and space from [5].
Metadata
Item Type: | Proceedings Paper |
---|---|
Authors/Creators: |
|
Editors: |
|
Copyright, Publisher and Additional Information: | © 2014, Springer. This is an author produced version of a paper published in Theory and Applications of Satisfiability Testing. Uploaded in accordance with the publisher's self-archiving policy. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-09284-3_13 |
Dates: |
|
Institution: | The University of Leeds |
Academic Units: | The University of Leeds > Faculty of Engineering & Physical Sciences (Leeds) > School of Computing (Leeds) > Institute for Computational and Systems Science (Leeds) |
Depositing User: | Symplectic Publications |
Date Deposited: | 16 Oct 2014 10:09 |
Last Modified: | 19 Dec 2022 13:28 |
Published Version: | http://dx.doi.org/10.1007/978-3-319-09284-3_13 |
Status: | Published |
Publisher: | Springer |
Series Name: | Lecture Notes in Computer Science |
Identification Number: | 10.1007/978-3-319-09284-3_13 |
Open Archives Initiative ID (OAI ID): | oai:eprints.whiterose.ac.uk:80490 |