Summary: Lightweight SAT solver

Description:
The SAT problem is the classical NP complete problem of searching
for a satisfying assignment of a propositional formula in
conjunctive normal form (CNF). General information on SAT can be
found at http://www.satlive.org or http://www.satlib.org.

URL: http://fmv.jku.at/picosat/
License: MIT-like

Maintainer: neoclust