Synthesis of Boolean Functions with Clausal Abstraction

by   Markus N. Rabe, et al.

Dependency quantified Boolean formulas (DQBF) is a logic admitting existential quantification over Boolean functions, which allows us to elegantly state synthesis problems in planning and verification. In this paper, we lift the clausal abstraction algorithm for quantified Boolean formulas (QBF) to DQBF. Clausal abstraction for QBF is an abstraction refinement algorithm that operates on a sequence of abstractions that represent the different quantifiers. For DQBF we need to generalize this principle to partial orders of abstractions. The two challenges to overcome are: (1) Clauses may contain literals with incomparable dependencies, which we address by the recently proposed proof rule called fork extension, and (2) existential variables may have spurious dependencies, which we prevent by tracking (partial) Skolem functions during the execution. Our prototype implementation shows improved performance compared to previous algorithms.


page 1

page 2

page 3

page 4


Extending Prolog for Quantified Boolean Horn Formulas

Prolog is a well known declarative programming language based on proposi...

On Quantifying Literals in Boolean Logic and Its Applications to Explainable AI

Quantified Boolean logic results from adding operators to Boolean logic ...

Encodings of Bounded Synthesis

The reactive synthesis problem is to compute a system satisfying a given...

Understanding and Extending Incremental Determinization for 2QBF

Incremental determinization is a recently proposed algorithm for solving...

Improving Reasoning on DQBF

The aim of this PhD project is to develop fast and robust reasoning tool...

On Expansion and Resolution in CEGAR Based QBF Solving

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

A fuzzified BRAIN algorithm for learning DNF from incomplete data

Aim of this paper is to address the problem of learning Boolean function...