Implementation of the Binary Decision Diagrams in Racket

LiBDD is a multi-platform Binary Decision Diagrams package.

Implementation of ROBDD in python

Rust powered engine for solving Boolean satisfiability problems

Modeled the proof systems of Analytic-Tableaux, First-Order-Resolution, ROBDD etc. in Ocaml to efficiently solve the SAT problem

Assignment 3, Digital Logic Design Lab, Spring 2021, IIT Bombay

Assignment 4, Digital Logic Design Lab, Spring 2021, IIT Bombay

All-in-one proposition to ROBDD constructor, featured by LALR parsing

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.

Minimal ROBDD library

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.

A library to create, minimize and optimize binary decision diagrams https://github.com/pubkey/binary-decision-diagram