Het bronpakket minisat2 downloaden:
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.
|
|
|
| Platform | Pakketgrootte | Geïnstalleerde grootte | Bestanden |
|---|---|---|---|
| alpha | 40,3 kB | 156 kB | [overzicht] |
| amd64 | 41,8 kB | 156 kB | [overzicht] |
| arm | 41,7 kB | 148 kB | [overzicht] |
| armel | 41,0 kB | 148 kB | [overzicht] |
| hppa | 44,5 kB | 152 kB | [overzicht] |
| i386 | 39,6 kB | 108 kB | [overzicht] |
| ia64 | 65,0 kB | 244 kB | [overzicht] |
| mips | 42,5 kB | 168 kB | [overzicht] |
| mipsel | 42,5 kB | 168 kB | [overzicht] |
| powerpc | 43,3 kB | 156 kB | [overzicht] |
| s390 | 41,0 kB | 152 kB | [overzicht] |
| sparc | 38,2 kB | 148 kB | [overzicht] |