Results 31 to 40 of about 3,939,918 (112)

Optimal Ordered Binary Decision Diagrams for Tree-like Circuits

, 1996
Many Boolean functions have short representations by OBDDs (ordered binary decision diagrams), if appropriate variable orderings are used. For tree-like circuits which may contain EXOR-gates it is proved that some depth first traversal leads to an ...
Ingo Wegener, Ralph Werchner, Martin Sauerhoff   +2 more
core  

CFLOBDDs: Context-Free-Language Ordered Binary Decision Diagrams

This paper presents a new compressed representation of Boolean functions, called CFLOBDDs (for Context-Free-Language Ordered Binary Decision Diagrams).
Sistla, Meghana, Chaudhuri, Swarat, Reps, Thomas   +2 more
core   +1 more source

Learning ordered binary decision diagrams

We study the learnability of ordered binary decision diagrams (obdds). We give a polynomial-time algorithm using membership and equivalence queries that finds the minimum obdd for the target respecting a given ordering.
Gavaldà Mestre, Ricard, Guijarro Guillem, David   +1 more
core  

Building free Binary Decision Diagrams using SAT solvers

, 2007
Free Binary Decision Diagrams (FBDDs) are a data structure for the representation of Boolean functions. In contrast to Ordered Binary Decision Diagrams (OBDDs) FBDDs allow different variable orderings along each path.
Görschwin Fey, Rolf Drechsler, Robert Wille   +2 more
core   +1 more source

Ordered Binary Decision Diagrams and the Davis-Putnam Procedure

, 1994
We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the Davis-Putnam procedure. Experimental results indicate that the Davis-Putnam procedure outperforms obdds in hard constraint-satisfaction
Tomás E. Uribe, Mark E. Stickel
core  

Anytime Algorithms for ROBDD Symmetry Detection and Approximation [PDF]

Reduced Ordered Binary Decision Diagrams (ROBDDs) provide a dense and memory efficient representation of Boolean functions. When ROBDDs are applied in logic synthesis, the problem arises of detecting both classical and generalised symmetries.
Kettle, Neil
core  

Using Ordered Decision Diagrams for Computer-Aided Manipulation of Boolean Functions [PDF]

, 2017
Odločitveni grafi so uspešna podatkovna struktura za predstavitev logičnih funkcij. V diplomskem delu so podane potrebne matematične osnove za njihovo razumevanje in računalniški algoritmi za njihovo učinkovito realizacijo.
Meolic, Robert
core  

Factored Edge-Valued Binary Decision Diagrams

, 1997
Factored Edge-Valued Binary Decision Diagrams form an extension to Edge-Valued Binary Decision Diagrams. By associating both an additive and a multiplicative weight with the edges, FEVBDDs can be used to represent a wider range of functions concisely. As
Paul Tafertshofer, Massoud Pedram
core  

Size and Structure of Random Ordered Binary Decision Diagrams

, 1998
We investigate the size and structure of ordered binary decision diagrams (OBDDs) for random Boolean functions. While it was known that for `most' values of n , the expected OBDD size of a random Boolean function with n variables is equal the worst ...
Clemens Gröpl, Anand Srivastav, Hans Jürgen Prömel   +2 more
core  

Ordered Binary Decision Diagrams, Graph Theory and Computational Geometry

, 1995
Ordered binary decision diagrams (OBDDs in short) have been shown as a powerful paradigm in handling Boolean functions and have been applied to many fields such as VLSI CAD, AI, combinatorics, etc.
Hiroshi Imai, Kyoko Sekine, Seiichiro Tani   +2 more
core   +1 more source