The funsat package
Funsat is a native Haskell SAT solver that uses modern techniques for solving SAT instances. Current features include two-watched literals, conflict-directed learning, non-chronological backtracking, a VSIDS-like dynamic variable ordering, and restarts. Our goal is to facilitate convenient embedding of a reasonably fast SAT solver as a constraint solving backend in other applications. Currently along this theme we provide unsatisfiable core generation, giving (hopefully) small unsatisfiable sub-problems of unsatisfiable input problems (see Funsat.Resolution).
|Versions||0.4, 0.5, 0.5.1, 0.5.2, 0.6.0, 0.6.1, 0.6.2|
|Dependencies||array, base, bitset (==0.*), containers, fgl, mtl, parse-dimacs (>=1.2 && <2), pretty, QuickCheck, random, time|
|Maintainer||Denis Bueno <firstname.lastname@example.org>|
|Upload date||Wed Feb 18 14:07:25 UTC 2009|
For package maintainers and hackage trustees