We present a new CEGAR-based algorithm for QBF. The algorithm builds on a
decomposition of QBFs into a sequence of propositional formulas, which we call the clausal …

The famous archetypical NP-complete problem of Boolean satisfiability (SAT) and its
PSPACE-complete generalization of quantified Boolean satisfiability (QSAT) have become …

We present a novel approach to solve quantified boolean formulas with one quantifier
alternation (2QBF). The algorithm incrementally adds new constraints to the formula until the …

Proof systems for quantified Boolean formulas (QBFs) provide a theoretical underpinning for
the performance of important QBF solvers. However, the proof complexity of these proof …

Computing many useful properties of Boolean formulas, such as their weighted or
unweighted model count, is intractable on general representations. It can become tractable …

iDQ: Instantiation-Based DQBF Solving Page 1 iDQ: Instantiation-Based DQBF Solving
Andreas Fröhlich1, Gergely Kovásznai2, Armin Biere1, Helmut Veith2 1 Johannes Kepler …

A general and long-standing belief in the proof complexity community asserts that there is a
close connection between progress in lower bounds for Boolean circuits and progress in …

Existing proof-generating quantified Boolean formula (QBF) solvers must construct a
different type of proof depending on whether the formula is false (refutation) or true …

In the context of reasoning on quantified Boolean formulas (QBFs), the extension of
propositional logic with existential and universal quantifiers, it is beneficial to use …

Many synthesis problems can be solved by formulating them as a quantified Boolean
formula (QBF). For such problems, a mere true/false answer is often not enough. Instead …