… closed QBFs in this paper. A closed QBF is either true or false, since if we semantically expand
all the … A prenex QBF is a QBF where all quantification is done outside of the propositional …

… In addition to Q-Res, we consider two further QBF resolution calculi that have … expansion-based
QBF solving. The basic idea used in expansion-based QBF solving is to first expand the …

… over existing methods by providing alternative short proofs of two known hardness results.
We also … the two major QBF expansion systems must have unbounded quantifier alternations. …

… short, semantically-intuitive proofs, supplanting the complicated ad hoc arguments that hitherto
represented the state-of-the-art in QBF … [19] on the explicit expansion of their unbounded …

… CDCL in QBF (QCDCL) and expansion have mutual advantages. Indeed, there are formulas
that have short proofs in expansion based proof systems but not in QCDCL proofs and vice …

… the two systems on a family of QBFs with an unbounded number of quantification … QBFs
with only three quantifier blocks that have short V-Red proofs but require exponential proofs …

… calculus, which enables refuting QBFs by rules similar to … proofs from conflict-driven
DPLL-based QBF solvers. The system ∀Exp+Res can on the other hand certify certain expansion-…

… and expansion-based solving. To model the strength of these QBF solvers, a number of
resolution-based QBF … , we define families of QBFs that require exponential-size proofs in AC0[p]-…

… paper will lift to further QBF calculi, and most notably to expansion-based systems. We
therefore highlight the potential for dependency schemes in expansion solving, and endorse the …

… We show that Drrs can identify crucial independencies in these formulas, leading to short
proofs in the system QU(Drrs)-Res. In contrast, we show that Dstd cannot identify …