BDDs Naturally Represent Boolean Functions, and ZDDs Naturally Represent Sets of Sets

06/27/2018
by   Kensuke Kojima, et al.
0

This paper studies a difference between Binary Decision Diagrams (BDDs) and Zero-suppressed BDDs (ZDDs) from a conceptual point of view. It is commonly understood that a BDD is a representation of a Boolean function, whereas a ZDD is a representation of a set of sets. However, there is a one-to-one correspondence between Boolean functions and sets of sets, and therefore we could also regard a BDD as a representation of a set of sets, and similarly for a ZDD and a Boolean function. The aim of this paper is to give an explanation why the distinction between BDDs and ZDDs mentioned above is made despite the existence of the one-to-one correspondence. To achieve this, we first observe that Boolean functions and sets of sets are equipped with non-isomorphic functor structures, and show that these functor structures are reflected in the definitions of BDDs and ZDDs. This result can be stated formally as naturality of certain maps. To the author's knowledge, this is the first formally stated theorem that justifies the commonly accepted distinction between BDDs and ZDDs. In addition, we show that this result extends to sentential decision diagrams and their zero-suppressed variant.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/13/2018

On the Relative Succinctness of Sentential Decision Diagrams

Sentential decision diagrams (SDDs) introduced by Darwiche in 2011 are a...
research
03/20/2020

Ordered Functional Decision Diagrams

Several BDD variants were designed to exploit special features of Boolea...
research
10/17/2017

Chain Reduction for Binary and Zero-Suppressed Decision Diagrams

Chain reduction enables reduced ordered binary decision diagrams (BDDs) ...
research
09/26/2022

Lower Bound Proof for the Size of BDDs representing a Shifted Addition

Decision Diagrams(DDs) are one of the most popular representations for b...
research
11/26/2017

Low degree almost Boolean functions are sparse juntas

Nisan and Szegedy showed that low degree Boolean functions are juntas. K...
research
04/15/2014

On the Role of Canonicity in Bottom-up Knowledge Compilation

We consider the problem of bottom-up compilation of knowledge bases, whi...
research
09/19/2019

Symbolic dynamics and rotation symmetric Boolean functions

We identify the weights wt(f_n) of a family {f_n} of rotation symmetric ...

Please sign up or login with your details

Forgot password? Click here to reset