awesome-sat-solvers
github.com/urbanophile/awesome-sat-solvers ↗A curated collection of resources for the Boolean Satisfiability Problem (SAT).
71
GitHub Stars
125
Curated Resources
6
Categories
12 hours ago
Last Refreshed
Introductions and TutorialsSAT SolversRelated SolversOther Software and LibrariesResearchOther Resources
Use this list with your AI agent
Add the Context Awesome MCP server to Claude, Cursor, or any MCP client, then ask:
"Show me benchmarks and problems resources from awesome-sat-solvers"
Installation instructions →What's inside
Other Resources
- 2025Benchmarks and Problems
- CH 10 Random Satisfiability (2nd Ed.)Handbook
- CH 12 Automated Configuration and Selection of SAT Solvers (2nd Ed.)Handbook
- CH 14 Bound Model Checking (1st Ed.)Handbook
- CH 15 Proofs of Unsatisfiability (2nd Ed.)Handbook
- CH 19 Planning and SATHandbook
SAT Solvers
- "An Efficient Algorithm for Unit Propagation"Core concepts
- codeImportant Solvers
local search -
- codeImportant Solvers
Chaff introduced important data structures and heuristics. -
- codeImportant Solvers
GRASP pioneered the modern approach of CDCL. -
- codeImportant Solvers
Famous for being good, short (2k LOC), and introducing incremental SAT, MiniSAT is still widely used. Clear and worth reading espcially version 1.12!
- codeImportant Solvers
Uses XOR primitive -
Introductions and Tutorials
- A Peek Inside SAT Solvers - Jon Smockvideos
Accessible 30 minute overview
- Boolean Satisfiability: From Theoretical Hardness to Practical Successsurveys
An older academic survey from 2007
- Bug Catching: Automated Program Verificationacademic tutorials and uni courses
2017
- Conflict Driven Clause Learninghands-on
Basic interactive tutorial on a SAT, DPLL, and CDCL
- Constraint Satisfactionvideos
- Course from Armin Biere for undergradsacademic tutorials and uni courses
2023
Related Solvers
Other Software and Libraries
Showing a sample of 125 resources. View the full list on GitHub →