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
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
|Versions [faq]||0.1.0.0, 0.2.0.0, 0.2.1.0|
|Dependencies||base (==4.13.*), containers (>=0.6.2 && <0.7), hashable (>=1.3.0 && <1.4), mtl (>=2.2.2 && <2.3), unordered-containers (>=0.2.10 && <0.3) [details]|
|Source repo||head: git clone https://github.com/eddiejones2108/decision-diagrams|
|Uploaded||by eddiejones at 2020-05-07T08:34:43Z|
|Downloads||172 total (16 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs uploaded by user [build log]
All reported builds failed as of 2020-05-07 [all 1 reports]
For package maintainers and hackage trustees