A Free World Class High Performance SAT Solver
-
Updated
Jul 12, 2021 - JavaScript
A Free World Class High Performance SAT Solver
A lightweight package for evaluating formulas of Boolean logic
Computes the satisfiability (SAT) of a disjunctive-normal-form (DNF)
Welcome to SAT->Start, a work in progress educational tool built to help visualize various SAT solving algorithms.
Add a description, image, and links to the satisfiability topic page so that developers can more easily learn about it.
To associate your repository with the satisfiability topic, visit your repo's landing page and select "manage topics."