License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ITCS.2021.12
URN: urn:nbn:de:0030-drops-135519
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/13551/
Beyersdorff, Olaf ;
Böhm, Benjamin
Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution
Abstract
QBF solvers implementing the QCDCL paradigm are powerful algorithms that successfully tackle many computationally complex applications. However, our theoretical understanding of the strength and limitations of these QCDCL solvers is very limited.
In this paper we suggest to formally model QCDCL solvers as proof systems. We define different policies that can be used for decision heuristics and unit propagation and give rise to a number of sound and complete QBF proof systems (and hence new QCDCL algorithms). With respect to the standard policies used in practical QCDCL solving, we show that the corresponding QCDCL proof system is incomparable (via exponential separations) to Q-resolution, the classical QBF resolution system used in the literature. This is in stark contrast to the propositional setting where CDCL and resolution are known to be p-equivalent.
This raises the question what formulas are hard for standard QCDCL, since Q-resolution lower bounds do not necessarily apply to QCDCL as we show here. In answer to this question we prove several lower bounds for QCDCL, including exponential lower bounds for a large class of random QBFs.
We also introduce a strengthening of the decision heuristic used in classical QCDCL, which does not necessarily decide variables in order of the prefix, but still allows to learn asserting clauses. We show that with this decision policy, QCDCL can be exponentially faster on some formulas.
We further exhibit a QCDCL proof system that is p-equivalent to Q-resolution. In comparison to classical QCDCL, this new QCDCL version adapts both decision and unit propagation policies.
BibTeX - Entry
@InProceedings{beyersdorff_et_al:LIPIcs.ITCS.2021.12,
author = {Olaf Beyersdorff and Benjamin B\"{o}hm},
title = {{Understanding the Relative Strength of QBF CDCL Solvers and QBF Resolution}},
booktitle = {12th Innovations in Theoretical Computer Science Conference (ITCS 2021)},
pages = {12:1--12:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-177-1},
ISSN = {1868-8969},
year = {2021},
volume = {185},
editor = {James R. Lee},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/13551},
URN = {urn:nbn:de:0030-drops-135519},
doi = {10.4230/LIPIcs.ITCS.2021.12},
annote = {Keywords: CDCL, QBF, QCDCL, proof complexity, resolution, Q-resolution}
}
|
Keywords: |
|
CDCL, QBF, QCDCL, proof complexity, resolution, Q-resolution |
|
Collection: |
|
12th Innovations in Theoretical Computer Science Conference (ITCS 2021) |
|
Issue Date: |
|
2021 |
|
Date of publication: |
|
04.02.2021 |
