sat-micro-hs: A minimal SAT solver
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.
Downloads
- sat-micro-hs-0.1.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1, 0.1.1 |
|---|---|
| Dependencies | base, containers, haskell98, mtl, parse-dimacs, pretty [details] |
| License | LicenseRef-LGPL |
| Author | Denis Bueno |
| Maintainer | Denis Bueno <dbueno@gmail.com> |
| Category | Algorithms |
| Uploaded | by DenisBueno at 2008-02-27T05:21:16Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Executables | sat-micro |
| Downloads | 1914 total (9 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs not available [build log] All reported builds failed as of 2017-01-03 [all 8 reports] |