On Expansion and Resolution in CEGAR Based QBF Solving

@inproceedings{Tentrup2017OnEA,
  title={On Expansion and Resolution in CEGAR Based QBF Solving},
  author={Leander Tentrup},
  booktitle={CAV},
  year={2017}
}
A quantified Boolean formula (QBF) is a propositional formula extended with universal and existential quantification over propositions. There are two methodologies in CEGAR based QBF solving techniques, one that is based on a refinement loop that builds partial expansions and a more recent one that is based on the communication of satisfied clauses. Despite their algorithmic similarity, their performance characteristics in experimental evaluations are very different and in many cases orthogonal… 
Expansion-Based QBF Solving Without Recursion
TLDR
This paper presents an expansion-based approach to solving quantified Boolean formulas (QBF), the extension of propositional formulas with existential and universal quantifiers over Boolean variables with state-of-the-art techniques.
CAQE and QuAbS: Abstraction Based QBF Solvers
TLDR
The clausal abstraction algorithm started as a solving algorithm for QBFs in prenex conjunctive normal form incorporating an efficient Skolem and Herbrand function extraction and was extended to non-prenex and negation normal form formulas, leading the way for improved performance in solving and function extraction.
Solving QBF by Abstraction
TLDR
A recursive counterexample guided abstraction and refinement algorithm (CEGAR) for solving and certifying QBFs that exploits structural reasoning on the formula level and how to derive an efficient certification extraction method on top of the algorithm is presented.
Clausal Abstraction for DQBF (full version)
TLDR
The clausal abstraction algorithm for quantified Boolean formulas (QBF) is lifted to DQBF, and the implementation dCAQE solves significantly more formulas than the existing DQ BF algorithms.
Evaluating QBF Solvers: Quantifier Alternations Matter
TLDR
An experimental study of the effects of quantifier alternations on the evaluation of quantified Boolean formula (QBF) solvers shows empirically that the performance of solvers based on different solving paradigms substantially varies depending on the numbers of alternations in PCNFs.
Clausal Abstraction for DQBF
TLDR
The clausal abstraction algorithm for quantified Boolean formulas (QBF) is lifted to DQBF, a logic admitting existential quantification over Boolean functions, which allows for elegantly state synthesis problems in verification such as the search for invariants, programs, or winning regions of games.
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations
TLDR
A novel algorithm for expansion-based QBF solving that deals with the whole quantifier prefix at once and is conceptually simpler than present recursive approaches.
Understanding and Extending Incremental Determinization for 2QBF
TLDR
This paper formalizes incremental determinization as a set of inference rules to help understand the design space of similar algorithms and presents additional inference rules that extend incremental determination in two ways.
Synthesis of Boolean Functions with Clausal Abstraction
TLDR
The clausal abstraction algorithm for quantified Boolean formulas is lifted to DQBF, a logic admitting existential quantification over Boolean functions, and shows improved performance compared to previous algorithms.
A Cube Distribution Approach to QBF Solving and Certificate Minimization
TLDR
A new view on QBF solving and certificate generation is given by the cube distribution interpretation, which provides a largely increased flexibility for QBF reasoning and allows compact certificate derivation with don’t cares.
...
...

References

SHOWING 1-10 OF 27 REFERENCES
On Unification of QBF Resolution-Based Calculi
TLDR
A novel calculus is defined, which is resolution- based and enables unification of the principal existing resolution-based QBF calculi, namely Q-resolution, long-distance Q- resolution and the expansion-based calculus ∀Exp+Res.
CAQE: A Certifying QBF Solver
TLDR
A new CEGAR-based algorithm for QBF is presented that builds on a decomposition of QBFs into a sequence of propositional formulas, which is called the clausal abstraction, which leads to a simpler notion of refinement compared to earlier approaches.
Q-Resolution with Generalized Axioms
TLDR
A variant of the Q-resolution calculus with generalized axioms in the QBF solver DepQBF is implemented, allowing for the direct combination of orthogonal solving techniques in any QBF proof system.
On Stronger Calculi for QBFs
TLDR
This work analyzes different translations of QBFs and shows that first-order resolution combined with such translations can polynomially simulate well-known deduction concepts for QBFs, and extends QBF calculi by the possibility to instantiate a universal variable by an existential variable of smaller level.
Solving QBF with counterexample guided refinement
TLDR
Two promising avenues in QBF are opened: CEGAR-driven solvers as an alternative to existing approaches and a novel type of learning in DPLL.
Solving QBF by Clause Selection
TLDR
A novel QBF algorithm is developed, which generalizes the concept of enumeration of implicit hitting sets and is competitive with, and often outperforms, the state of the art in QBF solving.
A Non-prenex, Non-clausal QBF Solver with Game-State Learning
TLDR
Experimental results on the QBFLIB benchmarks indicate the proposed DPLL-based solver outperforms other state-of-the-art solvers on certain benchmark families, including the tipfixpoint and tipdiam families of model checking problems.
Expansion-based QBF solving versus Q-resolution
Contributions to the Theory of Practical Quantified Boolean Formula Solving
TLDR
This paper shows an exponential worst case for the clause-learning procedure, and it is shown that variable-elimination resolution is sound for effectively depth-monotonic literals even when they are not at innermost scope.
On Q-Resolution and CDCL QBF Solving
TLDR
This paper shows that CDCL solving not only does not simulate Q-resolution, but also that this is deeply embedded in the workings of the solver, contrasts with SAT solving, where CDCL solvers have been shown to simulate resolution.
...
...