Results 11 to 20 of about 3,866,349 (62)
Approximate BDD Minimization by Weighted A* [PDF]
, 2008 Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synthesis. The size of BDDs depends on a chosen variable ordering, i.e.
Rudiger Ebendt +3 more
core +2 more sources
Terminological Reasoning in SHIQ with Ordered Binary Decision Diagrams
, 2008 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
Krotzsch, Markus +2 more
core +4 more sources
Size of ordered binary decision diagrams representing threshold functions [PDF]
, 1997 An ordered binary decision diagram (OBDD) is a graph representation of a Boolean function. In this paper, the size of ordered binary decision diagrams representing threshold functions is discussed. We consider two cases: the case when a variable ordering
Kaneda, T. +3 more
core +1 more source
Optimal Ordered Binary Decision Diagrams for Read-Once Formulas [PDF]
, 1999 In many applications like verification or combinatorial optimization, OBDDs (ordered binary decision diagrams) are used as a representation or data structure for Boolean functions.
Ingo Wegener +5 more
core +1 more source
Ordered Binary Decision Diagrams as Knowledge-Bases
, 1999 We propose to make use of ordered binary decision diagrams (OBDDs) as a means of realizing knowledge-bases. We show that the OBDD-based representation is more efficient and suitable in some cases, compared with the traditional CNF-based and/or model ...
Toshihide Ibaraki, Takashi Horiyama
core +1 more source
Query Learning Algorithm for Ordered Multi-Terminal Binary Decision Diagrams
, 2023 We propose a query learning algorithm for ordered multi-terminal binary decision diagrams (OMTBDDs) using at most n equivalence and 2n(l\lcei\log_2 m\rceil+ 3n) membership queries by extending the algorithm for ordered binary decision diagrams (OBDDs ...
Nakamura, Atsuyoshi
core
Comparing BDD and SAT based techniques for model checking Chaum's Dining Cryptographers Protocol [PDF]
, 2006 We analyse different versions of the Dining Cryptographers protocol by means of automatic verification via model checking. Specifically we model the protocol in terms of a network of communicating automata and verify that the protocol meets the anonymity
Raimondi, F. +5 more
core
Binary Decision Diagrams for Random Boolean Functions [PDF]
, 1999 Binary Decision Diagrams (BDDs) sind eine Datenstruktur für Boolesche Funktionen, die auch unter dem Namen branching program bekannt ist. In ordered binary decision diagrams (OBDDs) müssen die Tests einer festen Variablenordnung genügen.
Gröpl, C., Gröpl, Clemens
core +1 more source
Learning Ordered Binary Decision Diagrams
, 1995 This note studies 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.
David Guijarro +2 more
core +1 more source
Symbolic Boolean Manipulation with Ordered Binary Decision Diagrams
, 2018 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.
Randal Bryant (3892378)
core +1 more source