funsat: A modern DPLL-style SAT solver
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).
[Skip to Readme]
Downloads
- funsat-0.5.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
Versions [RSS] | 0.4, 0.5, 0.5.1, 0.5.2, 0.6.0, 0.6.1, 0.6.2 |
---|---|
Dependencies | array, base (<4.8), bitset, containers, fgl, mtl, parse-dimacs, parsec, pretty, QuickCheck, random, time [details] |
License | LicenseRef-LGPL |
Author | Denis Bueno |
Maintainer | Denis Bueno <dbueno@gmail.com> |
Revised | Revision 1 made by sjakobi at 2022-01-28T22:50:13Z |
Category | Algorithms |
Uploaded | by DenisBueno at 2008-06-10T02:32:30Z |
Distributions | |
Reverse Dependencies | 2 direct, 0 indirect [details] |
Executables | funsat |
Downloads | 5788 total (23 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs uploaded by user Build status unknown [no reports yet] |