obdd alternatives and similar packages
Based on the "Logic" category.
Alternatively, view obdd alternatives based on common mentions on social networks and blogs.
-
tamarin-prover
Main source code repository of the Tamarin prover for security protocol verification. -
atp-haskell
Haskell version of the code from "Handbook of Practical Logic and Automated Reasoning" -
logic-classes
Framework for propositional and first order logic, theorem proving -
structural-induction
SII: Structural Induction Instantiator over any strictly-positive algebraic data type. -
g4ip-prover
Theorem prover for intuitionistic propositional logic, fork of github.com/cacay/G4ip -
haskhol-core
The core logical system of the HaskHOL theorem prover. See haskhol.org for more details.
InfluxDB - Power Real-Time Data Analytics at Scale
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of obdd or a related project?
README
A pure Haskell implementation of Reduced Orderded Binary Decision Diagrams.
This is mostly educational. The BDDs do not share nodes 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 (low level, high level).