Log In Sign Up

On Expansion and Resolution in CEGAR Based QBF Solving

by   Leander Tentrup, et al.

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. We compare those CEGAR approaches using proof theory developed around QBF solving and present a unified calculus that combines the strength of both approaches. Lastly, we implement the new calculus and confirm experimentally that the theoretical improvements lead to improved performance.


page 1

page 2

page 3

page 4


Expansion-Based QBF Solving Without Recursion

In recent years, expansion-based techniques have been shown to be very p...

A Proof of the Front-Door Adjustment Formula

We provide a proof of the the Front-Door adjustment formula using the do...

QRAT+: Generalizing QRAT by a More Powerful QBF Redundancy Property

The QRAT (quantified resolution asymmetric tautology) proof system simul...

Towards Uniform Certification in QBF

We pioneer a new technique that allows us to prove a multitude of previo...

Short Proofs for Some Symmetric Quantified Boolean Formulas

We exploit symmetries to give short proofs for two prominent formula fam...

Advanced Tools and Methods for Treewidth-Based Problem Solving – Extended Abstract

Computer programs, so-called solvers, for solving the well-known Boolean...

QBF Solving by Counterexample-guided Expansion

We introduce a novel generalization of Counterexample-Guided Inductive S...