Brenda is a boolean expression solver for Go AST
-
Updated
Feb 6, 2019 - Go
Brenda is a boolean expression solver for Go AST
A fast and certifying solver for quantified Boolean formulas.
A Reduced-order Binary Decision Diagram (RoBDD) SAT solver written in Rust
SLIME Cloud: A Free Massive World Class High Performance SAT Solver, Winner of Crypto Track and 3rd place on Cloud Track at the SAT Competition 2021.
MiniZinc ↔ .NET
Generate and solve random instances of MAX-SAT and instances of MAX-SAT that are deterministically and pseudo-randomly generated from the solutions of previous MAX-SAT instances. This is a prototype of how a proof of work algorithm can be derived from a relevant problem.
Different heuristics and random initialization methods applied to GSAT and WalkSAT algorithms
Rust powered engine for solving Boolean satisfiability problems
Boolean SAT solver based on DPLL algorithm with randomization and geometric restarts (RGR) heuristic
CDCL SAT Solver from Scratch in Python
A Lazy Clause Generation solver with a focus on modularity and maintainability in addition to speed
Python tool for converting ANF to (2-)XNF.
python implementations of algorthims for the boolean satisfiability problem, including one to solve 3SAT in polynomial time
OCaml experimental sat3 solver
The boolean satisfaction and optimization library for .NET
Super efficient SAT solver in 500 lines of code
Advanced Algorithms | Spring 2021 | DPLL SAT solver for Sudoku
CDCL based SAT Solver for boolean formulas in DIMACS CNF format
Using Javascript to configure the new approach to how to handle and sort large dataset known as SAT often referred to as Boolean satisfiability in a timeframe using predetermined results to speed things up.
Slitherlink Puzzle interpreting as a SAT Problem
Add a description, image, and links to the boolean-satisfiability topic page so that developers can more easily learn about it.
To associate your repository with the boolean-satisfiability topic, visit your repo's landing page and select "manage topics."