The funsat package

[Tags: bsd3, library, program]

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]

Properties

Versions0.4, 0.5, 0.5.1, 0.5.2, 0.6.0, 0.6.1, 0.6.2
Change logCHANGES
Dependenciesarray, base (<4), bimap (==0.2.*), bitset (==1.*), containers, fgl, mtl, parse-dimacs (>=1.2 && <2), pretty, QuickCheck (==2.*), random, time [details]
LicenseBSD3
AuthorDenis Bueno
MaintainerDenis Bueno <dbueno@gmail.com>
Stabilitybeta
CategoryAlgorithms
Home pagehttp://github.com/dbueno/funsat
Executablesfunsat
UploadedSun Feb 27 01:35:19 UTC 2011 by DenisBueno
DistributionsNixOS:0.6.2
Downloads1093 total (48 in last 30 days)
Votes
0 []
StatusDocs not available [build log]
All reported builds failed as of 2015-05-19 [all 1 reports]

Modules

Downloads

Maintainers' corner

For package maintainers and hackage trustees

Readme for funsat-0.6.2

-*- mode: outline -*-

* Funsat: A DPLL-style SAT solver in pure Haskell

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").


* Installation
Install using the typical Cabal procedure:

    $ ghc --make -o Setup Setup.hs
    $ ./Setup configure
    $ ./Setup build

This will produce a binary called funsat at ./dist/build/funsat/funsat and a
standalone library interface for the solver.  If you feel like profiling the
code, a profiling binary is automatically built in
./dist/build/funsat-prof/funsat-prof.

** Dependencies
All the dependences are cabal-ised and available from hackage, or in etc/.

*** parse-dimacs
A haskell CNF file parser.

http://hackage.haskell.org/cgi-bin/hackage-scripts/package/parse-dimacs

*** bitset
http://hackage.haskell.org/cgi-bin/hackage-scripts/package/bitset