Synthesis of Boolean Functions with Clausal Abstraction

08/27/2018
by   Markus N. Rabe, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

03/01/2021

Extending Prolog for Quantified Boolean Horn Formulas

Prolog is a well known declarative programming language based on proposi...
08/23/2021

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

Quantified Boolean logic results from adding operators to Boolean logic ...
03/26/2018

Encodings of Bounded Synthesis

The reactive synthesis problem is to compute a system satisfying a given...
05/31/2019

Understanding and Extending Incremental Determinization for 2QBF

Incremental determinization is a recently proposed algorithm for solving...
10/02/2019

Improving Reasoning on DQBF

The aim of this PhD project is to develop fast and robust reasoning tool...
03/26/2018

On Expansion and Resolution in CEGAR Based QBF Solving

A quantified Boolean formula (QBF) is a propositional formula extended w...
02/21/2010

A fuzzified BRAIN algorithm for learning DNF from incomplete data

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