Data structures for Boolean functions build an essential component of design automation tools, especially in the area of logic synthesis. The state of the art data structure is the ordered binary decision diagram (OBDD), which results from general binary decision diagrams (BDDs), also called branching programs, by ordering restrictions. In the context of EXOR-based logic synthesis another type ...

Data structures for Boolean functions build an essential component of design automation tools, especially in the area of logic synthesis. The state of the art data structure is the ordered binary decision diagram (OBDD), which results from general binary decision diagrams (BDDs), also called branching programs, by ordering restrictions. In the context of EXOR-based logic synthesis another type ...

We develop two heuristics for reducing the time andspace required to obtain a binary decision diagram representation ofthe solutions of a configuration problem. First, we show that dynam-ics of the growth in the size of the decision diagram depend stronglyon the order in which constraints are added and propose a heuristicconstraint ordering algorithm that uses the distinctiv...

The sentential decision diagram (SDD) has been recently proposed as a new tractable representation of Boolean functions that generalizes the influential ordered binary decision diagram (OBDD). Empirically, compiling CNFs into SDDs has yielded significant improvements in both time and space over compiling them into OBDDs, using a bottomup compilation approach. In this work, we present a top-down...

In a binary decision diagram (BDD), a non-terminal node representing a function f = xf0_xf1 has two edges for f0 and f1. In the arithmetic ternary decision diagram (Arith TDD), each non-terminal node has three edges, where the third edge denotes f2 = f0 + f1, and + is an integer addition. The Arith TDD represents the extended weight function, an integer function showing the numbers of true mint...

The representations of assembly knowledge and assembly sequences are crucial in assembly planning, where the size of parts involved is a significant and often prohibitive difficulty. Zero-suppressed binary decision diagram (ZBDD) is an efficient form to represent and manipulate the sets of combination, and appears to give improved results for large-scale combinatorial optimization problems. In ...