Results 1  10
of
4,066
Symbolic Boolean manipulation with ordered binarydecision diagrams
 ACM COMPUTING SURVEYS
, 1992
"... Ordered BinaryDecision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented as grap ..."
Abstract

Cited by 1036 (13 self)
 Add to MetaCart
Ordered BinaryDecision Diagrams (OBDDS) represent Boolean functions as directed acyclic graphs. They form a canonical representation, making testing of functional properties such as satmfiability and equivalence straightforward. A number of operations on Boolean functions can be implemented
Partial Binary Decision Diagrams
"... AbstractDecision diagrams provide compact representations for discrete functions. There are some functions for which binary decision diagrams reach exponential size. Presented here is a method of representing Boolean functions as multiple partial decision diagrams. Index Terms binary decision di ..."
Abstract
 Add to MetaCart
AbstractDecision diagrams provide compact representations for discrete functions. There are some functions for which binary decision diagrams reach exponential size. Presented here is a method of representing Boolean functions as multiple partial decision diagrams. Index Terms binary decision
Binary Decision Graphs
 Static Analyis Symposium SASâ€™99, LNCS 1694
, 1999
"... Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to classes of infinite functions of increasing complexity are presented. The first one is closed by intersection and union, the second o ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to classes of infinite functions of increasing complexity are presented. The first one is closed by intersection and union, the second
Compressing Binary Decision Diagrams
"... Abstract. The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size of the ..."
Abstract
 Add to MetaCart
Abstract. The paper introduces a new technique for compressing Binary Decision Diagrams in those cases where random access is not required. Using this technique, compression and decompression can be done in linear time in the size of the BDD and compression will in many cases reduce the size
Equational Binary Decision Diagrams
 LOGIC FOR PROGRAMMING AND REASONING, LPAR2000, VOLUME 1955 OF LECTURE NOTES IN ARTIFICIAL INTELLIGENCE
, 2000
"... We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQBDDs. A straightforward notion of ordered EQBDDs (EQOBDD) is defined, and it is proved that each EQBDD is logically equivalent to an EQOBDD. Moreover, on EQOBDDs satisfiability and tautology checki ..."
Abstract

Cited by 9 (6 self)
 Add to MetaCart
We incorporate equations in binary decision diagrams (BDD). The resulting objects are called EQBDDs. A straightforward notion of ordered EQBDDs (EQOBDD) is defined, and it is proved that each EQBDD is logically equivalent to an EQOBDD. Moreover, on EQOBDDs satisfiability and tautology
Binary Decision Diagrams and Beyond: Enabling Technologies for Formal Verification
, 2006
"... Ordered Binary Decision Diagrams (OBDDs) have found ..."
Abstract

Cited by 121 (0 self)
 Add to MetaCart
Ordered Binary Decision Diagrams (OBDDs) have found
BDD Binary Decision Diagram
"... Abstractâ€”This paper proposes efficient methods to assess the reliability of phasedmission systems (PMS) considering both imperfect fault coverage (IPC), and commoncause failures (CCF). The IPC introduces multimode failures that must be considered in the accurate reliability analysis of PMS. Anoth ..."
Abstract
 Add to MetaCart
. Another difficulty in analysis is to allow for multiple CCF that can affect different subsets of system components, and which can occurdependently. Our methodology for resolving the above difficulties is to separate the consideration of both IPC and CCF from the combinatorics of the binary decision
Binary Decision Diagrams
"... Decision diagrams are a natural representation of finite functions. The obvious complexity measures are length and size which correspond to time and space of computations. Decision diagrams are the right model for considering space lower bounds and timespace tradeoffs. Due to the lack of powerfu ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
of powerful lower bound techniques, various types of restricted decision diagrams are investigated. They lead to new lower bound techniques and some of them allow efficient algorithms for a list of operations on boolean functions. Indeed, restricted decision diagrams like ordered binary decision diagrams
Binary Decision Trees
"... . In this paper we consider the possibility of overcoming fragmentation during the construction of decision trees by dividing the values of discriminating nominal attributes into two groups and constructing only two subtrees, one for each group. We discuss some of the problems and limitations that m ..."
Abstract
 Add to MetaCart
comparative study of the performance of the proposed binary partition procedure and C4.5 demonstrate that the former sometimes performs markedly better and never performs significantly worse. Keywords: Binary Decision Trees, Zeta, Fragmentation 1 Introduction During the last two decades decision tree
An introduction to Binary Decision Diagrams
 Lecture Notes, http://www.cs.auc.dk/~kgl/VERIFICATION99/mm4.html
, 1997
"... x ..."
Results 1  10
of
4,066