MiniMaxSat: A New Weighted Max-SAT Solver

In this paper we introduce MINIMAXSAT, a new Max-SAT solver that incorporates the best SAT and Max-SAT techniques. It can handle hard clauses (clauses of mandatory satisfaction as in SAT), soft clauses (clauses whose falsification is penalized by a cost as in Max-SAT) as well as pseudo-boolean objective functions and constraints. Its main features are: learning and backjumping on hard clauses; resolution-based and subtraction-based lower bounding; and lazy propagation with the two-watched literals scheme. Our empirical evaluation on a wide set of optimization benchmarks indicates that its performance is usually close to the best specialized alternative and, in some cases, even better.

• Type: Conference
• Year: 2007
• Where: SAT
• Authors: Federico Heras, Javier Larrosa, Albert Oliveras
• Keywords: Hard Clauses, Max-SAT, SAT 2007, Soft Clauses