Results 41 to 50 of about 239 (84)
An Anytime Algorithm for Generalized Symmetry Detection in ROBDDs [PDF]
, 2008 Detecting symmetries has many applications in logic synthesis that include, amongst other things, technology mapping, deciding equivalence of Boolean functions when the input correspondence is unknown and finding support-reducing bound sets.
Kettle, Neil +3 more
core +1 more source
Extending greedy feature selection algorithms to multiple solutions. [PDF]
Data Min Knowl Discov, 2021 Borboudakis G, Tsamardinos I.
europepmc +1 more source
Learning ordered binary decision diagrams [PDF]
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 +1 more
core
OBDDs, SDDs, and circuits of bounded width: completeness matters [PDF]
Ordered Binary Decision Diagrams (OBDDs) are dynamic data structures with many application areas. The literature suggested that OBDDs of bounded width equate to Boolean circuits of bounded pathwidth.
de Colnet, A. +5 more
core +1 more source
Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification [PDF]
, 1995 Ordered Binary Decision Diagrams (OBDDs) have found widespread use in CAD applications such as formal verification, logic synthesis, and test generation.
Randal E. Bryant
core
Binary Decision Diagrams and the Multiple Variable Order Problem [PDF]
, 1998 Ordered Binary Decision Diagrams (OBDDs) are the first choice in manipulating and representing Boolean functions in CAD. Since the size of an OBDD heavily depends on the chosen variable order, much effort is spent in finding good and improving existing ...
Stangier C. +5 more
core +2 more sources
An exponential lower bound for a constraint propagation proof system based on ordered binary decision diagrams [PDF]
, 2007 We prove an exponential lower bound on the size of proofs in the proof system operating with ordered binary decision diagrams introduced by Atserias, Kolaitis and Vardi [2].
Jan Krajicek
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
Dynamic Minimization of Sentential Decision Diagrams [PDF]
, 2013 The Sentential Decision Diagram (SDD) is a recently proposed representation of Boolean functions, containing Ordered Binary Decision Diagrams (OBDDs) as a distinguished subclass.
Choi, Arthur, Darwiche, Adnan
core +1 more source
On the error resilience of ordered binary decision diagrams [PDF]
, 2014 An Ordered Binary Decision Diagram (OBDD) is a data structure that is used in an increasing number of fields of Computer Science (e.g., logic synthe- sis, program verification, data mining, bioinformatics, and data protection) for representing and ...
Ciriani, Valentina +8 more
core +1 more source