A fast and certifying solver for quantified Boolean formulas.
-
Updated
Apr 30, 2024 - C
A fast and certifying solver for quantified Boolean formulas.
Brenda is a boolean expression solver for Go AST
Boolean SAT solver based on DPLL algorithm with randomization and geometric restarts (RGR) heuristic
AI4Verification,Verfication,EDA,AI4EDA,SAT
A Reduced-order Binary Decision Diagram (RoBDD) SAT solver written in Rust
Different heuristics and random initialization methods applied to GSAT and WalkSAT algorithms
Repo for the project of the course on Combinatorial Decision Making and Optimization @ Unibo
Advanced Algorithms | Spring 2021 | DPLL SAT solver for Sudoku
python implementations of algorthims for the boolean satisfiability problem, including one to solve 3SAT in polynomial time
Slitherlink Puzzle interpreting as a SAT Problem
CNF Encodings for the Min-Max Multiple Traveling Salesmen Problem
Experimental SAT solver written in C language. The program uses bitmaps to represent the search state, and bitwise operations are at the backbone of the algorithm implementation.
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.
Python tool for converting ANF to (2-)XNF.
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.
Boolean satisfiability problem (SAT), maximum satisfiability problem (MAX-SAT) etc
CDCL SAT Solver from Scratch in Python
CDCL based SAT Solver for boolean formulas in DIMACS CNF format
The boolean satisfaction and optimization library for .NET
OCaml experimental sat3 solver
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."