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. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Heras, F., Larrosa, J., & Oliveras, A. (2007). MiniMaxSat: A new weighted Max-SAT solver. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4501 LNCS, pp. 41–55). Springer Verlag. https://doi.org/10.1007/978-3-540-72788-0_8
Mendeley helps you to discover research relevant for your work.