niklasso/minisat

Health v2 · maintenance only

Flags: no_releases no_license

Adoption not part of the score

1189 stars · 418 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

MiniSat is a minimalistic, high-performance Boolean satisfiability (SAT) solver written in C++. It reads CNF formulas and either finds a satisfying assignment or proves unsatisfiability, and can be embedded as a C++ library or used as a command-line tool.

Use cases

• solve boolean satisfiability problems from DIMACS CNF files
• embed a SAT solver in a C++ application for constraint solving
• verify hardware or software designs via SAT encoding
• solve scheduling and planning problems reduced to SAT
• use SAT as a backend for model checking or theorem proving

When to choose

• you need a small, fast, well-understood SAT solver with a simple C++ API
• you want a classic solver with proven heuristics (VSIDS, clause learning)
• you need a command-line tool for DIMACS CNF instances

When to avoid

• you need SMT, optimization (MaxSAT), or incremental solving features beyond basic SAT
• you want a modern solver with active development and the latest performance improvements
• you need a permissive license — MiniSat's MIT-style license has an unusual non-commercial clause

Facets

library · maturity maintenance

search-engine parser developer-tools cpp cross-platform sat-solver constraint-solving cnf boolean-satisfiability algorithms linux macos

Member repositories

For agents

markdown · JSON · MCP: product_card(name="niklasso/minisat")