Log In Sign Up

QBF Solving by Counterexample-guided Expansion

by   Roderick Bloem, et al.

We introduce a novel generalization of Counterexample-Guided Inductive Synthesis (CEGIS) and instantiate it to yield a novel, competitive algorithm for solving Quantified Boolean Formulas (QBF). Current QBF solvers based on counterexample-guided expansion use a recursive approach which scales poorly with the number of quantifier alternations. Our generalization of CEGIS removes the need for this recursive approach, and we instantiate it to yield a simple and efficient algorithm for QBF solving. Lastly, this research is supported by a competitive, though straightforward, implementation of the algorithm, making it possible to study the practical impact of our algorithm design decisions, along with various optimizations.


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...

On Solving Quantified Bit-Vectors using Invertibility Conditions

We present a novel approach for solving quantified bit-vector formulas i...

An efficient algorithm for solving elliptic problems on percolation clusters

We present an efficient algorithm to solve elliptic Dirichlet problems d...

A Recursive Algorithm for Solving Simple Stochastic Games

We present two recursive strategy improvement algorithms for solving sim...

Program Synthesis as Dependency Quantified Formula Modulo Theory

Given a specification φ(X,Y) over inputs X and output Y, defined over a ...

A Theory of Formal Synthesis via Inductive Learning

Formal synthesis is the process of generating a program satisfying a hig...

On Expansion and Resolution in CEGAR Based QBF Solving

A quantified Boolean formula (QBF) is a propositional formula extended w...