Description
Provides a SAT solver implemented in pure Haskell. SAT solvers determine whether boolean constraints can be satisfied, which is useful for search and verification problems.
It is useful for research tools, teaching, analyzers, planners, and applications that encode problems as boolean formulas. It is a developer library and not an interactive solver interface.