Results 1  10
of
2,350
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
Learning Ordered Binary Decision Diagrams
 In 6th International Workshop on Algorithmic Learning Theory, Lecture Notes in Artificial Intelligence No. 997, Jantke, Shinohara, Zeugmann (Eds
, 1995
"... This note studies the learnability of ordered binary decision diagrams (obdds). We give a polynomialtime 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 ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
This note studies the learnability of ordered binary decision diagrams (obdds). We give a polynomialtime 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
Ordered Binary Decision Diagrams and the DavisPutnam Procedure
 IN PROC. OF THE 1ST INTERNATIONAL CONFERENCE ON CONSTRAINTS IN COMPUTATIONAL LOGICS
, 1994
"... We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicate that the DavisPutnam procedure outperforms obdds in hard constraintsatisfaction problems, while obdds are clearly superior for ..."
Abstract

Cited by 51 (1 self)
 Add to MetaCart
We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicate that the DavisPutnam procedure outperforms obdds in hard constraintsatisfaction problems, while obdds are clearly superior
Terminological Reasoning in SHIQ with Ordered Binary Decision Diagrams
 In Proceedings of the 23rd AAAI Conference on Artficial Intelligence (AAAI08
"... We present a new algorithm for reasoning in the description logic SHIQ, which is the most prominent fragment of the Web Ontology Language OWL. The algorithm is based on ordered binary decision diagrams (OBDDs) as a datastructure for storing and operating on large model representations. We thus draw ..."
Abstract

Cited by 12 (7 self)
 Add to MetaCart
We present a new algorithm for reasoning in the description logic SHIQ, which is the most prominent fragment of the Web Ontology Language OWL. The algorithm is based on ordered binary decision diagrams (OBDDs) as a datastructure for storing and operating on large model representations. We thus draw
Composition of Reduced Ordered Binary Decision Diagrams
"... A widely accepted opinion is that, under a certain ordering restriction, the class of Reduced Ordered Binary Decision Diagrams (ROBDDs) is closed under composition. However, in this paper we show that this is not correct. We formulate necessary and sufficient conditions for the composition of two RO ..."
Abstract
 Add to MetaCart
A widely accepted opinion is that, under a certain ordering restriction, the class of Reduced Ordered Binary Decision Diagrams (ROBDDs) is closed under composition. However, in this paper we show that this is not correct. We formulate necessary and sufficient conditions for the composition of two
Ordered Binary Decision Diagrams and the Shannon Effect
, 2003
"... We investigate the size and structure of ordered binary decision diagrams (OBDDs) for random Boolean functions. It was known that for most values of n, the expected OBDD size of a random Boolean function with n variables is equal to the worstcase size up to terms of lower order. Such a phenomenon i ..."
Abstract
 Add to MetaCart
We investigate the size and structure of ordered binary decision diagrams (OBDDs) for random Boolean functions. It was known that for most values of n, the expected OBDD size of a random Boolean function with n variables is equal to the worstcase size up to terms of lower order. Such a phenomenon
Secure Function Evaluation with Ordered Binary Decision Diagrams
, 2006
"... Privacypreserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptographic primitive for designing privacypreserving protocols is secure function evaluation (SFE). The classic solution for ..."
Abstract

Cited by 23 (1 self)
 Add to MetaCart
based representation called ordered binary decision diagrams (OBDDs). For a large number of Boolean functions, OBDDs are more succinct than the gatebased representation. Preliminary experimental results based on a prototype implementation shows that for several functions, our protocol results in a smaller bandwidth
Automatic verification of multiagent systems by model checking via ordered binary decision diagrams
 Journal of Applied Logic
"... checking via ordered binary decision diagrams ..."
Ordered Binary Decision Diagrams as KnowledgeBases
 Artificial Intelligence
, 1999
"... . We propose to make use of ordered binary decision diagrams (OBDDs) as a means of realizing knowledgebases. We show that the OBDDbased representation is more ecient and suitable in some cases, compared with the traditional CNFbased and/or modelbased representations from the view point of spa ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
. We propose to make use of ordered binary decision diagrams (OBDDs) as a means of realizing knowledgebases. We show that the OBDDbased representation is more ecient and suitable in some cases, compared with the traditional CNFbased and/or modelbased representations from the view point
of Boolean functions. In contrast to Ordered Binary Decision Diagrams
"... Abstract: Free Binary Decision Diagrams (FBDDs) are a data structure for the representation ..."
Abstract
 Add to MetaCart
Abstract: Free Binary Decision Diagrams (FBDDs) are a data structure for the representation
Results 1  10
of
2,350