obdd: Ordered Reduced Binary Decision Diagrams

Construct, combine and query OBDDs; an efficient representation for formulas in propositional logic.

This is mostly educational. The BDDs do not share nodes (there is no persistent BDD base) and this might introduce inefficiencies.

An important (for me, in teaching) feature is that I can immediately draw the BDD to an X11 window (via graphviz). For example, to show the effect of different variable orderings, try this in ghci:

import qualified Prelude as P
import OBDD
let f [] = false; f (x:y:zs) = x && y || f zs
display P.$ f P.$ P.map variable [1,2,3,4,5,6]
display P.$ f P.$ P.map variable [1,4,2,5,3,6]

If you want better performance, use CUDD Haskell bindings, see this example.

Modules

[Index]

Downloads

• obdd-0.8.1.tar.gz [browse] (Cabal source package)
• Package description (as included in the package)

Maintainer's Corner

Package maintainers

• JohannesWaldmann

For package maintainers and hackage trustees

• edit package information

Candidates

• No Candidates