awesome-sat-solvers
A curated collection of resources for the Boolean Satisfiability Problem (SAT).
https://github.com/urbanophile/awesome-sat-solvers
Last synced: 16 days ago
JSON representation
-
Solvers
-
Related Areas
-
Next Door
-
Same Neighbourhood
-
-
Introductions and Tutorials
-
hands-on
- Conflict Driven Clause Learning - Basic interactive tutorial on a SAT, DPLL, and CDCL
- Tutorial introduction to Z3 in Python - Short intro to using the z3 python bindings
- MiniZinc tutorial - An intro to constraint satisfaction taking you through solving combinatorial optimisation problems
- LogicNG tutorial - Uses the Java LogicNG library to solve SAT problems, includes a general introduction to SAT.
-
videos
- Simons Workshop SAT bootcamp - Workshop from 2021 which has introductory lectures to modern SAT solving
- Theoretical Foundations of Applied SAT Solving - Workshop from 2014 with many useful videos.
- A Peek Inside SAT Solvers - Jon Smock - Accessible 30 minute overview
- Constraint Satisfaction
-
academic tutorials and uni courses
- SAT/SMT school from SAT association - Links to many of the old summer schools from the SAT association with introductory material
- SAT tutorials from SAT association - Links to academic books and tutorials on SAT
- Course from Armin Biere for undergrads - 2023
- Bug Catching: Automated Program Verification - 2017
-
surveys
- Modern SAT solvers: fast, neat and underused (part 1 of N) - Popular blog series introducing SAT
- The Silent (R)evolution of SAT - Academic Survey from 2023
- Boolean Satisfiability: From Theoretical Hardness to Practical Success - An older academic survey from 2007
- Satisfiability Solvers - overview of whole SAT solvers area from Knowledge Representation Handbook 2008
-
-
Books
- CH 5 Look-Ahead Based SAT Solvers (1st Ed.)
- CH -2 SMT (1st Ed.)
- The Calculus of Computations - covers the logic theory background
- Decision Procedures: An Algorithmic Point of View - Great, practical book focusing on the algorithms of SAT and SMT. Strongly recommended.
- SAT/SMT by Example
- The Art of Computer Programming - Satisfiability
- CH 1 A History of Satisfiability
- CH 2 CNF Encodings
- CH 3 Complete Algorithms
- CH 4 Conflict-Driven Clause Learning SAT Solvers
- CH 6 Incomplete Algorithms
- CH 10 Random Satisfiability (2nd Ed.)
- CH 7 Proof Complexity and SAT Solving
- CH 8 Fundaments of Branching Heuristics
- CH 9 Preprocessing in SAT Solving (2nd Ed.)
- CH 14 Bound Model Checking (1st Ed.)
- CH 15 Proofs of Unsatisfiability (2nd Ed.)
- CH 23 MaxSAT, Hard and Soft Constraints (2nd Ed.)
- CH 19 Planning and SAT
-
SAT Solvers
-
Software
-
Verification of proofs
- DRAT-Trim - verifier of proofs of unsatisfiability (UNSAT)
-
Categories
Sub Categories