Results 1 to 10 of about 61,529 (217)
Difference Decision Diagrams [PDF]
, 1999 This paper describes a newdata structure, difference decision diagrams (DDDs), for representing a Boolean logic over inequalities of the form x-y ≤ c where the variables are integer or real-valued.We give algorithms for manipulating DDDs and for determining validity, satisfiability, and equivalence.
Jesper B. Møller +3 more
openaire +2 more sources
A Decision Diagram Operation for Reachability
, 2023 Saturation is considered the state-of-the-art method for computing fixpoints with decision diagrams. We present a relatively simple decision diagram operation called REACH that also computes fixpoints. In contrast to saturation, it does not require a partitioning of the transition relation.
Brand, Sebastiaan +2 more
openaire +5 more sources
Discrete Optimization with Decision Diagrams [PDF]
INFORMS Journal on Computing, 2016 We propose a general branch-and-bound algorithm for discrete optimization in which binary decision diagrams (BDDs) play the role of the traditional linear programming relaxation. In particular, relaxed BDD representations of the problem provide bounds and guidance for branching, and restricted BDDs supply a primal heuristic.
David Bergman +3 more
openaire +2 more sources
Optimal Decision Diagrams for Classification
Proceedings of the AAAI Conference on Artificial Intelligence, 2023 Decision diagrams for classification have some notable advantages over decision trees, as their internal connections can be determined at training time and their width is not bound to grow exponentially with their depth. Accordingly, decision diagrams are usually less prone to data fragmentation in internal nodes.
Alexandre M. Florio +4 more
openaire +4 more sources
Equational Binary Decision Diagrams [PDF]
, 2007 We allow equations in binary decision diagrams (BDD). The resulting objects are called EQ-BDDs. A straightforward notion of reduced ordered EQ-BDDs (EQ-OBDD) is defined, and it is proved that each EQ-BDD is logically equivalent to an EQ-OBDD. Moreover, on EQOBDDs satisfiability and tautology checking can be done in constant time.
J.F. Groote (Jan Friso) +1 more
openaire +5 more sources
Ternary decision diagrams. Survey [PDF]
Proceedings 1997 27th International Symposium on Multiple- Valued Logic, 2002 This paper surveys seven types of TDDs: General-TDD, SOP-TDD, ESOP-TDD, AND-TDD, prime-TDD, EXOR-TDD, and Kleene-TDD. We give new definitions for SOP-TDDs and ESOP-TDDs and introduce unifying terminology. After showing some theorems on complexities, we compare the sizes of these TDDs using benchmark functions. Finally, we review important works on TDDs.
openaire +2 more sources
Decomposition Based on Decision Diagrams [PDF]
, 2016 In recent years, decision diagrams (DDs) have proven useful for solving a variety of optimization problems, often closing long-standing instances from classical benchmarks. This success is primarily driven by a DDs ability to capture structure. This paper exploits this characteristic and proposes a novel solution method which decomposes a problem into ...
David Bergman, André A. Ciré
openaire +2 more sources
Compressing Binary Decision Diagrams
, 2008 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 BDD to 1-2 bits per node.
Hansen, Esben Rune +2 more
openaire +3 more sources
On the Relative Succinctness of Sentential Decision Diagrams [PDF]
Theory of Computing Systems, 2018 34 ...
Beate Bollig, Matthias Buttkus
openaire +3 more sources