1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
|
Source: minisat2
Section: science
Priority: extra
Maintainer: Michael Tautschnig <mt@debian.org>
Build-Depends: debhelper (>= 9), libz-dev
Standards-Version: 3.9.5
Homepage: http://minisat.se/
Vcs-Browser: http://github.com/niklasso/minisat
Vcs-Git: git://gitorious.org/minisat-debian/minisat2.git
Package: minisat
Architecture: any
Provides: minisat2
Replaces: minisat2 (<< 1:2.2.1-1)
Conflicts: minisat2 (<< 1:2.2.1-1)
Depends: ${shlibs:Depends}, ${misc:Depends}
Description: Fast and lightweight SAT solver
Despite the NP completeness of the satisfiability problem of Boolean formulas
(SAT), SAT solvers are often able to decide this problem in a reasonable time
frame. As all other NP complete problems are reducible to SAT, the solvers
have become a general purpose tool for this class of problems.
.
MiniSat is a minimalistic, open-source SAT solver, developed to help
researchers and developers alike to get started on SAT. Winning all the
industrial categories of the SAT 2005 competition, MiniSat is a good starting
point both for future research in SAT, and for applications using SAT.
Package: minisat2
Section: oldlibs
Architecture: any
Depends: ${shlibs:Depends}, ${misc:Depends}, minisat
Description: Transitional package for minisat
This is a transitional package for minisat, and can be safely removed after
the installation is complete.
|
