Results 1 to 10 of about 2,176 (251)
Symbolic Boolean manipulation with ordered binary-decision diagrams [PDF]
ACM Computing Surveys, 1992 Ordered Binary-Decision Diagrams (OBDDs) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satisfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented as graph algorithms on OBDD data structures ...
Randal E Bryant
exaly +7 more sources
Ordered binary decision diagrams and the Shannon effect [PDF]
Discrete Applied Mathematics, 2004 The state-of-the-art data structures for Boolean functions are known as ordered binary decision diagrams (OBDDs). An OBDD is an acyclic digraph with one root and two terminals 0 and 1. This paper is devoted to theoretical investigations on the size of the OBDD of a Boolean function which has been chosen according to the uniform distribution.
Hans Jürgen Promel, Anand Srivastav
exaly +3 more sources
Optimal ordered binary decision diagrams for read-once formulas [PDF]
Discrete Applied Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Martin Sauerhoff, Ingo Wegener
exaly +3 more sources
Ordered Binary Decision Diagrams as Knowledge-Bases [PDF]
Artificial Intelligence, 1999 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Takashi Horiyama, Toshihide Ibaraki
core +5 more sources
Learning ordered binary decision diagrams [PDF]
, 1995 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. We also prove that both types of queries and the restriction to a given ordering are necessary if we want minimality in the output ...
Gavaldà Mestre, Ricard +1 more
core +7 more sources
On the error resilience of ordered binary decision diagrams
Theoretical Computer Science, 2015 Ordered Binary Decision Diagrams (OBDDs) are a data structure that is used in an increasing number of fields of Computer Science (e.g., logic synthesis, program verification, data mining, bioinformatics, and data protection) for representing and manipulating discrete structures and Boolean functions.
Anna Bernasconi, Valentina Ciriani
exaly +4 more sources
Reasoning with ordered binary decision diagrams [PDF]
Discrete Applied Mathematics, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Takashi Horiyama, Toshihide Ibaraki
openaire +2 more sources
An iterative approach for counting reduced ordered binary decision diagrams [PDF]
, 2022 For three decades binary decision diagrams, a data structure efficiently representing Boolean functions, have been widely used in many distinct contexts like model verification, machine learning, cryptography and also resolution of combinatorial problems.
Clément, Julien, Genitrini, Antoine
core +8 more sources
On the descriptive and algorithmic power of parity ordered binary decision diagrams
Lecture Notes in Computer Science, 1997 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stephan Waack
exaly +3 more sources
Masking of Internal Nodes Faults Based on Applying of Incompletely Specified Boolean Functions [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2020 Combinational circuits (combinational parts of sequential circuits) are considered. Masking of internal nodes faults with applying sub-circuit, inputs of which are connected to the circuit inputs and outputs — to the circuit proper internal nodes, is ...
Matrosova, Angela Yu. +2 more
doaj +1 more source