1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
|
Source: minisat2
Section: science
Priority: extra
Maintainer: Michael Tautschnig <mt@debian.org>
Build-Depends: debhelper (>= 5), libz-dev
Standards-Version: 3.8.0
Package: minisat2
Architecture: any
Depends: ${shlibs:Depends}
Description: Fast and lightweight SAT solver
Despite the NP completeness of the satisfiabilty 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.
|
