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 (see Funsat.Resolution) and a logical circuit interface (see Funsat.Circuit). New in 0.6.2: works with ghc-6.12 and fixed some space leaks. =/
[Skip to Readme]
Modules
- Control
- Monad
- Control.Monad.MonadST
- Monad
- Funsat
- Funsat.Circuit
- Funsat.Monad
- Funsat.Resolution
- Funsat.Solver
- Funsat.Types
- Funsat.Types.Internal
- Text
- Text.Tabular
Downloads
- funsat-0.6.2.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.4, 0.5, 0.5.1, 0.5.2, 0.6.0, 0.6.1, 0.6.2 |
---|---|
Change log | CHANGES |
Dependencies | array, base (<4), bimap (>=0.2 && <0.3), bitset (>=1 && <2), containers, fgl, mtl, parse-dimacs (>=1.2 && <2), pretty, QuickCheck (>=2 && <3), random, time [details] |
License | BSD-3-Clause |
Author | Denis Bueno |
Maintainer | Denis Bueno <dbueno@gmail.com> |
Category | Algorithms |
Home page | http://github.com/dbueno/funsat |
Uploaded | by DenisBueno at 2011-02-27T01:35:19Z |
Distributions | |
Reverse Dependencies | 2 direct, 0 indirect [details] |
Executables | funsat |
Downloads | 5765 total (15 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 2016-12-28 [all 7 reports] |