Results 21 to 30 of about 3,939,918 (112)

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

Extended resolution simulates binary decision diagrams [PDF]

, 2007
We prove that binary decision diagrams [R. Bryant, Symbolic Boolean manipulation with ordered binary decision diagrams, ACM Comput. Surveys 23 (3) (1992)] can be polynomially simulated by the extended resolution rule of [G.S.
Nicolas Peltier, Peltier, Nicolas
core   +1 more source

Decision diagrams in machine learning: an empirical study on real-life credit-risk data. [PDF]

Decision trees are a widely used knowledge representation in machine learning. However, one of their main drawbacks is the inherent replication of isomorphic subtrees, as a result of which the produced classifiers might become too large to be ...
Files, CM, Mues, Christophe, Vanthienen, Jan, Baesens, Bart   +3 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

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

An Anytime Symmetry Detection Algorithm for ROBDDs [PDF]

, 2006
Detecting symmetries is crucial to logic synthesis, technology mapping, detecting function equivalence under unknown input correspondence, and ROBDD minimization. State-of-the-art is represented by Mishchenko's algorithm.
Kettle, Neil, Andy King, Neil Kettle, King, Andy   +3 more
core   +1 more source

Zero-Suppressed Binary Decision Diagrams Resilient to Index Faults

, 2014
This paper discusses the error resilience of Zero-Suppressed Binary Decision Diagrams (ZDDs), which are a particular family of Ordered Binary Decision Diagrams used for representing and manipulating combination sets.
V. Ciriani, Ciriani, Valentina, A. Bernasconi, Anna Bernasconi, Valentina Ciriani, BERNASCONI, ANNA, Ciriani V.   +6 more
core   +1 more source

Binary Decision Diagrams

, 2008
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.
Ingo Wegener, Detlef Sieling, Beate Bollig, Martin Sauerhoff   +3 more
core  

Partial Binary Decision Diagrams

, 2008
--Decision diagrams provide compact representations for discrete functions. There are some functions for which binary decision diagrams reach exponential size.

core  

Automatic verification of multi-agent systems by model checking via ordered binary decision diagrams [PDF]

, 2007
We present a methodology for the verification of multi-agent systems, whose properties are specified by means of a modal logic that includes a temporal, an epistemic, and a modal operator to reason about correct behaviour of agents.
Lomuscio, Alessio, Raimondi, Franco
core   +1 more source