DeepAI AI Chat
Log In Sign Up

Exact Synthesis of ESOP Forms

by   Heinz Riener, et al.

We present an exact synthesis approach for computing Exclusive-or Sum-of-Products (ESOP) forms with a minimum number of product terms using Boolean satisfiability. Our approach finds one or more ESOP forms for a given Boolean function. The approach can deal with incompletely-specified Boolean functions defined over many Boolean variables and is particularly fast if the Boolean function can be expressed with only a few product terms. We describe the formalization of the ESOP synthesis problem with a fixed number of terms as a decision problem and present search procedures for determining ESOP forms of minimum size. We further discuss how the search procedures can be relaxed to find ESOP forms of small sizes in reasonable time. We experimentally evaluate the performance of the SAT-based synthesis procedures on completely- and incompletely-specified Boolean functions.


Computing the Boolean product of two n× n Boolean matrices using O(n^2) mechanical operation

We study the problem of determining the Boolean product of two n× n Bool...

Knowledge Compilation for Boolean Functional Synthesis

Given a Boolean formula F(X,Y), where X is a vector of outputs and Y is ...

Revealing the canalizing structure of Boolean functions: Algorithms and applications

Boolean functions can be represented in many ways including logical form...

The alternative bases of Boolean functions as a means of improving the structure of digital blocks

This paper analyzes three forms of representation of Boolean functions, ...

Synthesis of Boolean Networks from Biological Dynamical Constraints using Answer-Set Programming

Boolean networks model finite discrete dynamical systems with complex be...

Inapproximability of Minimizing a Pair of DNFs or Binary Decision Trees Defining a Partial Boolean Function

The desire to apply machine learning techniques in safety-critical envir...