A survey on applications of quantified Boolean formulas
The decision problem of quantified Boolean formulas (QBFs) is the archetypical problem for
the complexity class PSPACE. Beside such theoretical aspects QBF also provides an …
the complexity class PSPACE. Beside such theoretical aspects QBF also provides an …
Quantified boolean formulas
Solvers for quantified Boolean formulas (QBF) have become powerful tools for tackling hard
computational problems from various application domains, even beyond the scope of SAT …
computational problems from various application domains, even beyond the scope of SAT …
Taming high treewidth with abstraction, nested dynamic programming, and database technology
Treewidth is one of the most prominent structural parameters. While numerous theoretical
results establish tractability under the assumption of fixed treewidth, the practical success of …
results establish tractability under the assumption of fixed treewidth, the practical success of …
Clausal abstraction for DQBF
Dependency quantified Boolean formulas (DQBF) is a logic admitting existential
quantification over Boolean functions, which allows us to elegantly state synthesis problems …
quantification over Boolean functions, which allows us to elegantly state synthesis problems …
[PDF][PDF] Understanding the relative strength of QBF CDCL solvers and QBF resolution
O Beyersdorff, B Böhm - Logical Methods in Computer …, 2023 - lmcs.episciences.org
QBF solvers implementing the QCDCL paradigm are powerful algorithms that successfully
tackle many computationally complex applications. However, our theoretical understanding …
tackle many computationally complex applications. However, our theoretical understanding …
CAQE and quabs: Abstraction based QBF solvers
L Tentrup - Journal on Satisfiability, Boolean Modeling and …, 2019 - content.iospress.com
We present a detailed description, analysis, and evaluation of the clausal abstraction
approach for solving quantified Boolean formulas (QBF). The clausal abstraction algorithm …
approach for solving quantified Boolean formulas (QBF). The clausal abstraction algorithm …
Qbffam: A tool for generating QBF families from proof complexity
We present QBFFam, a tool for the generation of formula families originating from the field of
proof complexity. Such formula families are used to investigate the strength of proof systems …
proof complexity. Such formula families are used to investigate the strength of proof systems …
Lower bounds for QCDCL via formula gauge
B Böhm, O Beyersdorff - Journal of Automated Reasoning, 2023 - Springer
QCDCL is one of the main algorithmic paradigms for solving quantified Boolean formulas
(QBF). We design a new technique to show lower bounds for the running time in QCDCL …
(QBF). We design a new technique to show lower bounds for the running time in QCDCL …
Hardness characterisations and size-width lower bounds for QBF resolution
O Beyersdorff, J Blinkhorn, M Mahajan… - ACM Transactions on …, 2023 - dl.acm.org
We provide a tight characterisation of proof size in resolution for quantified Boolean formulas
(QBF) via circuit complexity. Such a characterisation was previously obtained for a hierarchy …
(QBF) via circuit complexity. Such a characterisation was previously obtained for a hierarchy …
Quantified CDCL with universal resolution
F Slivovsky - 25th International Conference on Theory and …, 2022 - drops.dagstuhl.de
Abstract Quantified Conflict-Driven Clause Learning (QCDCL) solvers for QBF generate Q-
resolution proofs. Pivot variables in Q-resolution must be existentially quantified. Allowing …
resolution proofs. Pivot variables in Q-resolution must be existentially quantified. Allowing …