IABSD.fr/ports/math/minisat
Branch :
Log
| Author | Commit | Date | CI | Message |
|---|---|---|---|---|
 |
bcbf44ab | 2017-04-10 11:46:18 | use LIBCXX | |
 |
c2f5aec4 | 2017-02-27 19:48:41 | Respect CXX | |
 |
570aa62a | 2015-01-18 03:12:39 | Drop remaining MD5/RMD160/SHA1 checksums. | |
 |
0662a4e9 | 2013-03-11 11:20:26 | PERMIT_* / REGRESS->TEST sweep | |
|
c374fd92 | 2011-11-02 19:18:35 | cope with upstream's rerolled distfile and ps.gz -> pdf From Antti Harri, ok jasper@ | |
 |
05dd33cd | 2010-08-19 14:19:22 | update to minisat 2.2.0 OK jasper@ | |
 |
cedd0e2b | 2010-07-18 10:50:11 | REVISION | |
 |
fab7307b | 2010-05-13 18:29:47 | - bump to a version that support proof logging - don't hide compilation commands | |
|
a6b3d3a7 | 2009-09-18 09:31:33 | - resolve ambiguity about what SAT is (prodded by naddy@) - take maintainership | |
|
9110d91f | 2009-09-17 21:12:04 | import minisat 1.14 MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT. Some key features of MiniSat: * Easy to modify. MiniSat is small and well-documented, and possibly also well-designed, making it an ideal starting point for adapting SAT based techniques to domain specific problems. * Highly efficient. 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. * Designed for integration. MiniSat supports incremental SAT and has mechanisms for adding non-clausal constraints. By virtue of being easy to modify, it is a good choice for integrating as a backend to another tool, such as a model checker or a more generic constraint solver. |