472 search results - page 15 / 95 » Functional simulation using binary decision diagrams |
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We describe Haskell implementations of interesting combinatorial generation algorithms with focus on boolean functions and logic circuit representations. First, a complete exact c...
COCOON
2006
Springer
13 years 11 months ago
2006
Springer
We present an efficient reduction mapping undirected graphs G with n = 2k vertices for integers k to tables of partially specified Boolean functions g : {0, 1}4k+1 {0, 1, } so tha...
ISMIS
1994
Springer
13 years 11 months ago
1994
Springer
BDDs (binary decision diagrams) are a very succesful tool for handling boolean functions, but one which has not yet attracted the attention of many automated deduction specialists....
SAS
1999
Springer
13 years 12 months ago
1999
Springer
Abstract. Binary Decision Graphs are an extension of Binary Decision Diagrams that can represent some infinite boolean functions. Three refinements of BDGs corresponding to class...
HPCN
1997
Springer
13 years 11 months ago
1997
Springer
This paper describes a distributed algorithm for Boolean function manipulation. The algorithm is based on Binary Decision Diagrams (BDDs), which are one of the most commonly used ...