License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SAT.2022.22
URN: urn:nbn:de:0030-drops-166969
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2022/16696/
Mahajan, Meena ;
Sood, Gaurav
QBF Merge Resolution Is Powerful but Unnatural
Abstract
The Merge Resolution proof system (M-Res) for QBFs, proposed by Beyersdorff et al. in 2019, explicitly builds partial strategies inside refutations. The original motivation for this approach was to overcome the limitations encountered in long-distance Q-Resolution proof system (LD-Q-Res), where the syntactic side-conditions, while prohibiting all unsound resolutions, also end up prohibiting some sound resolutions. However, while the advantage of M-Res over many other resolution-based QBF proof systems was already demonstrated, a comparison with LD-Q-Res itself had remained open. In this paper, we settle this question. We show that M-Res has an exponential advantage over not only LD-Q-Res, but even over LQU^+-Res and IRM, the most powerful among currently known resolution-based QBF proof systems. Combining this with results from Beyersdorff et al. 2020, we conclude that M-Res is incomparable with LQU-Res and LQU^+-Res.
Our proof method reveals two additional and curious features about MRes: (i) M-Res is not closed under restrictions, and is hence not a natural proof system, and (ii) weakening axiom clauses with existential variables provably yields an exponential advantage over MRes without weakening. We further show that in the context of regular derivations, weakening axiom clauses with universal variables provably yields an exponential advantage over M-Res without weakening. These results suggest that M-Res is better used with weakening, though whether M-Res with weakening is closed under restrictions remains open. We note that even with weakening, M-Res continues to be simulated by eFrege+∀red (the simulation of ordinary M-Res was shown recently by Chew and Slivovsky).
BibTeX - Entry
@InProceedings{mahajan_et_al:LIPIcs.SAT.2022.22,
author = {Mahajan, Meena and Sood, Gaurav},
title = {{QBF Merge Resolution Is Powerful but Unnatural}},
booktitle = {25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022)},
pages = {22:1--22:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-242-6},
ISSN = {1868-8969},
year = {2022},
volume = {236},
editor = {Meel, Kuldeep S. and Strichman, Ofer},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2022/16696},
URN = {urn:nbn:de:0030-drops-166969},
doi = {10.4230/LIPIcs.SAT.2022.22},
annote = {Keywords: QBF, proof complexity, resolution, weakening, restrictions}
}
|
Keywords: |
|
QBF, proof complexity, resolution, weakening, restrictions |
|
Collection: |
|
25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022) |
|
Issue Date: |
|
2022 |
|
Date of publication: |
|
28.07.2022 |
