Path to this page:
NOTICE: This package has been removed from pkgsrc./
wip/minisat2,
Fast and lightweight SAT solver
Branch: CURRENT,
Version: 070721,
Package name: minisat2-070721,
Maintainer: jihbed.researchDespite 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
Master sites:
SHA1: cb4a58f8a8192a65b1b944c4307afdf029d51e1c
RMD160: a04236122afc4fba40b6e54da34b1b0d2ef4eda4
Filesize: 47.633 KB
Version history: (Expand)
- (2013-10-31) Package deleted from pkgsrc
- (2013-08-28) Package has been reborn
- (2013-08-28) Package deleted from pkgsrc
- (2013-03-09) Package has been reborn
- (2013-03-09) Package deleted from pkgsrc
- (2012-06-11) Package has been reborn
CVS history: (Expand)
2013-10-30 05:27:33 by Aleksej Saushev | Files touched by this commit (4) | |
Log message:
Remove minisat2, newer version in math/minisat.
|
2012-10-03 17:09:47 by Aleksej Saushev | Files touched by this commit (124) |
Log message:
Drop superfluous PKG_DESTDIR_SUPPORT, "user-destdir" is default these days.
Mark packages that don't or might probably not have staged installation.
|
2010-04-16 22:30:19 by Kamel Derouiche | Files touched by this commit (1) |
Log message:
change maintainer, move to jihbed.research@gmail.com
|
2009-06-10 17:30:20 by Kamel Derouiche | Files touched by this commit (2) |
Log message:
|
2009-06-09 18:03:03 by Kamel Derouiche | Files touched by this commit (4) | |
Log message:
Import minisat2-070721 as wip/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
|