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: circuits and BSD3 license.


[Skip to Readme]

Properties

Versions 0.4, 0.5, 0.5.1, 0.5.2, 0.6.0, 0.6.1, 0.6.2
Change log CHANGES
Dependencies array (==0.2.*), base (>=3 && <5), bimap (==0.2.*), bitset (==0.*), containers (==0.2.*), fgl (>=5 && <=5.4.2.2), mtl (==1.*), parse-dimacs (>=1.2 && <2), pretty (<2), QuickCheck (<2), random (<2), time (<1.2) [details]
License BSD3
Author Denis Bueno
Maintainer Denis Bueno <dbueno@gmail.com>
Stability beta
Category Algorithms
Home page http://github.com/dbueno/funsat
Uploaded Sat Jun 26 20:43:58 UTC 2010 by DenisBueno
Distributions NixOS:0.6.2
Downloads 1495 total (30 in the last 30 days)
Votes
0 []
Status Docs not available [build log]
All reported builds failed as of 2015-11-17 [all 4 reports]

Modules

  • Control
    • Monad
      • Control.Monad.MonadST
  • Funsat
    • Funsat.Circuit
    • Funsat.Monad
    • Funsat.Resolution
    • Funsat.Solver
    • Funsat.Types
      • Funsat.Types.Internal
    • Funsat.Utils
      • Funsat.Utils.Internal
  • Text
    • Text.Tabular

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Readme for funsat

Readme for funsat-0.6.1

-*- 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