Download Source Package minisat2:
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.
|
|
|
| Architecture | Package Size | Installed Size | Files |
|---|---|---|---|
| amd64 | 42.4 kB | 156 kB | [list of files] |
| armel | 41.7 kB | 148 kB | [list of files] |
| hppa | 45.1 kB | 152 kB | [list of files] |
| i386 | 40.3 kB | 108 kB | [list of files] |
| ia64 | 65.7 kB | 244 kB | [list of files] |
| mips | 43.1 kB | 168 kB | [list of files] |
| mipsel | 43.2 kB | 168 kB | [list of files] |
| powerpc | 43.9 kB | 156 kB | [list of files] |
| s390 | 41.6 kB | 152 kB | [list of files] |
| sparc | 38.8 kB | 148 kB | [list of files] |