sat-micro-hs: A minimal SAT solver

[ algorithms, program ] [ Propose Tags ]

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.


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • 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 <>
Category Algorithms
Uploaded by DenisBueno at 2008-02-27T05:21:16Z
Reverse Dependencies 1 direct, 0 indirect [details]
Executables sat-micro
Downloads 1880 total (8 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]