| Autor: |
Böhm, Benjamin, Peitl, Tomáš, Beyersdorff, Olaf |
| Zdroj: |
Journal of Automated Reasoning; Mar2024, Vol. 68 Issue 1, p1-31, 31p |
| Abstrakt: |
Quantified conflict-driven clause learning (QCDCL) is one of the main solving approaches for quantified Boolean formulas (QBF). One of the differences between QCDCL and propositional CDCL is that QCDCL typically follows the prefix order of the QBF for making decisions. We investigate an alternative model for QCDCL solving where decisions can be made in arbitrary order. The resulting system QCDCL A NY is still sound and terminating, but does not necessarily allow to always learn asserting clauses or cubes. To address this potential drawback, we additionally introduce two subsystems that guarantee to always learn asserting clauses ( QCDCL U NI - A NY ) and asserting cubes ( QCDCL E XI - A NY ), respectively. We model all four approaches by formal proof systems and show that QCDCL U NI - A NY is exponentially better than QCDCL on false formulas, whereas QCDCL E XI - A NY is exponentially better than QCDCL on true QBFs. Technically, this involves constructing specific QBF families and showing lower and upper bounds in the respective proof systems. We complement our theoretical study with some initial experiments that confirm our theoretical findings. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
Full text from SpringerLink