Building Free Binary Decision Diagrams Using SAT Solvers

Keywords (8)

Academic

Publications

Building Free Binary Decision Diagrams Using SAT Solvers

Edit

Building Free Binary Decision Diagrams Using SAT Solvers (Citations: 1)


	BibTex \| RIS \| RefWorks Download

Free Binary Decision Diagrams (FBDDs) are a data structure for the rep- resentation of Boolean functions. In contrast to Ordered Bi nary Decision Diagrams (OBDDs) FBDDs allow different variable orderings along each path. Thus, FBDDs are the more compact representation while most of the properties of OBDDs are kept. However, how to efficiently build small FBDDs for a given func tion is still an open question. In this work we propose FBDD construction with the help of SAT solvers. 'Recording' the single steps of a SAT solver during the searc h process leads to an FBDD.

Published in 2007.

Cumulative Annual

Citation Context (1)

- ...Preliminary results have been proposed in [11]...
Robert Wille, et al. Building Free Binary Decision Diagrams Using SAT Solvers

References (25)

Graph-Based Algorithms for Boolean Function Manipulation (Citations: 5294)

Randal E. Bryant

Journal: IEEE Transactions on Computers - TC , vol. C-35, no. 8, pp. 677-691, 1986
Efficient analysis and manipulation of obdds can be extended to fbdds (Citations: 38)

J. Gergov, C. Meinel

Journal: IEEE Transactions on Computers - TC , 1994
On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication (Citations: 330)

Randal E. Bryant

Journal: IEEE Transactions on Computers - TC , vol. 40, no. 2, pp. 205-213, 1991
Exact Minimization of Free BDDs and Its Application to Pass-Transistor Logic Optimization (Citations: 4)

Kazuyoshi TAKAGI, Hiroshi HATAKEDA, Shinji KIMURA, Katsumasa WATANABE

Published in 1999.
On the Relation between SAT and BDDs for Equivalence Checking (Citations: 24)

Sherief Reda, Rolf Drechsler, Alex Orailoglu

Conference: International Symposium on Quality Electronic Design - ISQED , pp. 394-399, 2002

Order by:

Citations (1)

Building Free Binary Decision Diagrams Using SAT Solvers (Citations: 1)

Robert Wille, Rolf Drechsler

Published in 2007.

Keywords (8)

Citation Context (1)

Robert Wille, et al. Building Free Binary Decision Diagrams Using SAT Solvers

References (25)

Graph-Based Algorithms for Boolean Function Manipulation (Citations: 5294)

Efficient analysis and manipulation of obdds can be extended to fbdds (Citations: 38)

On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication (Citations: 330)

Exact Minimization of Free BDDs and Its Application to Pass-Transistor Logic Optimization (Citations: 4)

On the Relation between SAT and BDDs for Equivalence Checking (Citations: 24)

Citations (1)

Building Free Binary Decision Diagrams Using SAT Solvers (Citations: 1)