Skip to main content

A curated collection of resources for the Boolean Satisfiability Problem (SAT).

68
GitHub Stars
125
Curated Resources
6
Categories
17 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

SAT Solvers

  • "An Efficient Algorithm for Unit Propagation"Core concepts

  • codeImportant Solvers

    local search -

  • codeImportant Solvers

    GRASP pioneered the modern approach of CDCL. -

  • codeOther solvers of interest:

  • codeImportant Solvers

    overall winner in SAT competition. Develops heuristic for structured bounded variable addition (SBVA), a preprocessing technique which automatically reencodes formulas by introducing new variables to eliminating clauses which frequently results in reducing formula size.

  • codeOther solvers of interest:

Introductions and Tutorials

Related Solvers

  • ApproxMCv6SharpSAT Solvers

  • BitwuzlaSMT Solvers

  • ChocoCSP Solvers

    Java-based

  • codeQBF solvers

    Solver is based on CEGAR not CDCL -

  • codeQBF solvers

    Based on an extension of CDCL -

  • codeIP Solvers

Other Software and Libraries

  • codeConfiguration of Solvers

  • codeConfiguration of Solvers

  • DRAT-TrimVerification of proofs

    verifier of proofs of unsatisfiability (UNSAT)

  • projectHigh Level Modelling Languages

  • projectHigh Level Modelling Languages

  • websiteLibraries

    wrapper library

Research

Showing a sample of 125 resources. View the full list on GitHub →