5 search results - page 1 / 1 » Model-Independent Bounding of the Supports of Boolean Formul... |
103
Voted
CINQ
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
109
click to vote
CADE
2005
Springer
16 years 17 days ago
2005
Springer
We describe an algorithm for deciding the first-order multisorted theory BAPA, which combines 1) Boolean algebras of sets of uninterpreted elements (BA) and 2) Presburger arithmeti...
89
Voted
DAC
2003
ACM
16 years 1 months ago
2003
ACM
Binary Decision Diagrams (BDDs) often fail to exploit sharing between Boolean functions that differ only in their support variables. In a memory circuit, for example, the function...
107
click to vote
PLDI
2004
ACM
15 years 5 months ago
2004
ACM
In this paper we present Jedd, a language extension to Java that supports a convenient way of programming with Binary Decision Diagrams (BDDs). The Jedd language abstracts BDDs as...
106
Voted
WEA
2005
Springer
15 years 5 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...