homepage: http://www.mathstat.dal.ca/~selinger/minisat-solver/
changelog-type: text
hash: e2ff11b1ca8c66e43f8bb2e04f21bd1b812efb94ff215d74f998c928e7e92dcd
test-bench-deps:
  easyrender: -any
  base: ! '>=4.6 && <5'
  containers: -any
  minisat-solver: -any
maintainer: selinger@mathstat.dal.ca
synopsis: High-level Haskell bindings for the MiniSat SAT solver.
changelog: ! "v0.1 2016/10/24\n\tInitial public release.\n"
basic-deps:
  base: ! '>=4.6 && <5'
  containers: -any
  transformers: -any
all-versions:
- '0.1'
author: Peter Selinger
latest: '0.1'
description-type: haddock
description: ! 'This package provides high-level Haskell bindings for the well-known

  MiniSat satisfiability solver. It solves the boolean satisfiability

  problem, i.e., the input is a boolean formula, and the output is a

  list of all satisfying assignments.

  MiniSat is a fully automated, well-optimized general-purpose SAT

  solver written by Niklas Een and Niklas Sorensson, and further

  modified by Takahisa Toda.

  Unlike other similar Haskell packages, we provide a convenient

  high-level interface to the SAT solver, hiding the complexity of the

  underlying C implementation. It can be easily integrated into other

  programs as an efficient turn-key solution to many search problems.

  To illustrate the use of the library, two example programs are

  included in the "examples" directory; one program solves Sudoku

  puzzles, and the other solves a 3-dimensional block packing

  problem. These programs can be built manually, or by invoking Cabal

  with the ''--enable-benchmarks'' option.'
license-name: MIT

Update from Hackage at 2016-10-24T21:09:53Z
Update from Hackage at 2016-10-24T21:09:53Z
