zsdd: Zero-Suppressed and Reduced Decision Diagrams

This package provides an efficient representation of propositions and families of sets as directed acyclic graphs. Internally this is a Free monad with shared subterms. All operations are linear in the size of the diagram, but the size of the diagram is also proportional to the number of operations.

There are two reduction stratergies Simple and ZeroSup. The former is generic and widely applicable, whereas the latter is specialised to sparse formulas. Sparse formulas are those with few models or where most atoms are false. A typical use cases of this mode is when modelling families of sets.

• Shin-ichi Minato, "Zero-suppressed BDDs for set manipulation in combinatorial problems", DAC '93: Proceedings of the 30th international Design Automation Conference https://dl.acm.org/doi/10.1145/157485.164890

Modules

[Index] [Quick Jump]

Downloads

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

Maintainer's Corner

Package maintainers

• No current members of group

For package maintainers and hackage trustees

• edit package information

Candidates

• 0.1.0.0