COMiniSatPS is a patched MiniSat generated by applying a series of small diff patches to the last available version (2.2.0) of MiniSat that was released several years ago. The essence of the patches is to include only minimal changes necessary to make MiniSat sufficiently competitive with modern SAT solvers. One important goal of COMiniSatPS is to provide these changes in a highly accessible and digestible form so that the necessary changes can be understood easily to benefit wide audience, particularly starters and non-experts in practical SAT. As such, the changes are provided as a series of incrementally applicable diff patches, each of which implements one feature at a time. COMiniSatPS has many variations. The variations are official successors to an early prototype code-named SWDiA5BY that saw great successes in the past SAT-related competitive events.
[1]
Gilles Audemard,et al.
Predicting Learnt Clauses Quality in Modern SAT Solvers
,
2009,
IJCAI.
[2]
Chanseok Oh.
Between SAT and UNSAT: The Fundamental Difference in CDCL SAT
,
2015,
SAT.
[3]
Jonathan Springer,et al.
Extreme SAT-based Constraint solving with R-Solve
,
2014,
2014 IEEE High Performance Extreme Computing Conference (HPEC).
[4]
Gilles Audemard,et al.
Refining Restarts Strategies for SAT and UNSAT
,
2012,
CP.
[5]
Niklas Sörensson,et al.
An Extensible SAT-solver
,
2003,
SAT.