An advanced SAT solver
-
Updated
Jul 10, 2024 - C++
An advanced SAT solver
DPLL boolean satisfiability solver for .NET
A benchmark suit for SAT solvers
A Formal Method playground for limboole, Z3, nuXmv, Alloy, and Spectra
A collection of tools to study the inversion or collision of truncated versions of MD4, MD5, SHA-256 with SAT solving using techniques such as Cube-and-Conquer, programmatic SAT, Dobbertin's Attack, and differential cryptanalysis.
MiniZinc playground using WebAssembly
Structured BVA CNF rewriter
😆 Boolean formula satisfiability algorithms for JavaScript
The Yices SMT Solver
Analysis of Formal Specifications SAT, SMT, Alloy, NuSMV.
Probabilistic Answer Set Programming and Probabilistic SAT solving, based on Differentiable Satisfiability
Use MiniZinc in the browser or with NodeJS
Access to all MiniZinc functionality directly from Python
Component for finding decomposition sets and estimating hardness of SAT instances.
A simple CDCL(Conflict-Driven-Clause-Learning) SAT solver in Rust.
My PhD thesis
gophersat, a SAT solver in Go
A DPLL SAT-solver developed for a piece of coursework using watched-literals, PLE and heuristics.
Add a description, image, and links to the sat-solver topic page so that developers can more easily learn about it.
To associate your repository with the sat-solver topic, visit your repo's landing page and select "manage topics."