A library to create, minimize and optimize binary decision diagrams https://github.com/pubkey/binary-decision-diagram
-
Updated
Dec 2, 2024 - TypeScript
A library to create, minimize and optimize binary decision diagrams https://github.com/pubkey/binary-decision-diagram
All-in-one proposition to ROBDD constructor, featured by LALR parsing
Rust powered engine for solving Boolean satisfiability problems
Implementation of ROBDD in python
A binary decision diagram is a directed acyclic graph used to represent a Boolean function. The ROBDD is a canonical form, which means that given an identical ordering of input variables, equivalent Boolean functions will always reduce to the same ROBDD.
LiBDD is a multi-platform Binary Decision Diagrams package.
Implementation of the Binary Decision Diagrams in Racket
Assignment 3, Digital Logic Design Lab, Spring 2021, IIT Bombay
Modeled the proof systems of Analytic-Tableaux, First-Order-Resolution, ROBDD etc. in Ocaml to efficiently solve the SAT problem
Minimal ROBDD library
Assignment 4, Digital Logic Design Lab, Spring 2021, IIT Bombay
Designing Equivalence Checker based on ROBDD algorithm, the engine input will be 2 boolean functions and results will be ROBDD graphs with equivalence or non-equivalence results.
Add a description, image, and links to the robdd topic page so that developers can more easily learn about it.
To associate your repository with the robdd topic, visit your repo's landing page and select "manage topics."