Source: haskell-incremental-sat-solver
Priority: optional
Section: misc
Maintainer: David Fox <dsf@seereason.com>
Build-Depends: debhelper (>= 7.0),
               haskell-devscripts (>= 0.6.15+nmu7),
               hscolour,
               cdbs,
               ghc (>= 6.8),
               ghc-prof,
               libghc-mtl-prof
Build-Depends-Indep: ghc-doc,
                     haddock,
                     libghc-mtl-doc
Standards-Version: 3.8.1
Homepage: http://github.com/sebfisch/incremental-sat-solver

Package: libghc-incremental-sat-solver-dev
Architecture: any
Section: haskell
Depends: ${haskell:Depends},
         ${misc:Depends}
Description: Simple, Incremental SAT Solving as a Library
 This Haskell library provides an implementation of the
 Davis-Putnam-Logemann-Loveland algorithm
 (cf. <http://en.wikipedia.org/wiki/DPLL_algorithm>) for
 the boolean satisfiability problem. It not only allows
 to solve boolean formulas in one go but also to add
 constraints and query bindings of variables
 incrementally.
 .
  Author: Sebastian Fischer
  Upstream-Maintainer: sebf@informatik.uni-kiel.de
 .
 This package contains the normal library files.

Package: libghc-incremental-sat-solver-prof
Architecture: any
Section: haskell
Depends: ${haskell:Depends},
         ${misc:Depends},
         libghc-incremental-sat-solver-dev
Description: Simple, Incremental SAT Solving as a Library
 This Haskell library provides an implementation of the
 Davis-Putnam-Logemann-Loveland algorithm
 (cf. <http://en.wikipedia.org/wiki/DPLL_algorithm>) for
 the boolean satisfiability problem. It not only allows
 to solve boolean formulas in one go but also to add
 constraints and query bindings of variables
 incrementally.
 .
  Author: Sebastian Fischer
  Upstream-Maintainer: sebf@informatik.uni-kiel.de
 .
 This package contains the libraries compiled with profiling enabled.

Package: libghc-incremental-sat-solver-doc
Architecture: all
Section: doc
Depends: ${haskell:Depends},
         ${misc:Depends},
         ghc-doc
Description: Simple, Incremental SAT Solving as a Library
 This Haskell library provides an implementation of the
 Davis-Putnam-Logemann-Loveland algorithm
 (cf. <http://en.wikipedia.org/wiki/DPLL_algorithm>) for
 the boolean satisfiability problem. It not only allows
 to solve boolean formulas in one go but also to add
 constraints and query bindings of variables
 incrementally.
 .
  Author: Sebastian Fischer
  Upstream-Maintainer: sebf@informatik.uni-kiel.de
 .
 This package contains the documentation files.