marekpiotrow/UWrMaxSat

UWrMaxSat is a relatively new MiniSat+-based solver participating in MaxSAT Evaluation 2019, where it ranked second places in both main tracks (weighted and unweighted). In MaxSAT Evaluation 2020 it won the weighted main track. It has been created recently at the University of Wrocław. It is a complete solver for partial weighted MaxSAT instances and pseudo-Boolean ones. It incrementally uses COMiniSatPS by Chanseok Oh (2016) as an underlying SAT solver, but may be compiled with other MiniSat-like solvers. It was developed on the top of our PB-solver (called kp-minisatp) that was presented at Pragmatics of SAT 2018 and which is an extension of the well-known MiniSat+ solver. In its main configuration, UWrMaxSat applies an unsatisfiability-core-based OLL procedure and uses the kp-minisatp sorter-based pseudo-Boolean constraint encoding to translate new cardinality constraints into CNF.

C++NOASSERTION