A minimal SAT solver

Latest on Hackage:0.1.1

This package is not currently in any snapshots. If you're interested in using it, we recommend adding it to Stackage Nightly. Doing so will make builds more reliable, and allow to host generated Haddocks.

LGPL licensed by Denis Bueno
Maintained by Denis Bueno

A complete (in the logical sense) SAT solver with non-chronological backtracking. This is a Haskell implementation of (most of) the minimal OCaml solver described in the paper "SAT-MICRO: petit mais costaud!" by Sylvain Conchon, Johannes Kanig, and Stephane Lescuyer.

Depends on 6 packages:
Used by 1 package:
comments powered byDisqus