TT-Open-WBO-Inc: An Efficient Anytime MaxSAT Solver-Reference-Cited by-同舟云学术

TT-Open-WBO-Inc: An Efficient Anytime MaxSAT Solver

Published:2024-09-06 Issue:1 Volume:15 Page:1-7
ISSN:1574-0617
Container-title:Journal on Satisfiability, Boolean Modeling and Computation
language:
Short-container-title:SAT

Author:

Nadel Alexander¹²

Affiliation:

1. The Faculty of Data and Decision Sciences, Technion – Israel Institute of Technology, Haifa, 3200003, Israel

2. Intel Corporation, Haifa, 3508409, Israel

Abstract

We present our anytime MaxSAT solver TT-Open-WBO-Inc, focusing on its evolution since the initial version that won both of the weighted incomplete tracks of MaxSAT Evaluation 2019 (MSE19). The solver’s MSE20 version claimed victory in these tracks at MSE20 and secured second place in both unweighted incomplete tracks. The major innovation in the MSE20 version was the integration of SAT-based local search. The contributions of this paper include: (1) Introducing a previously unpublished variant of the SAT-based local search algorithm Polosat, Polosat-OBV, applied by default already in the MSE20 version, and showing its superiority for weighted solving; (2) Describing and analyzing TT-Open-WBO-Inc’s unweighted component, not studied in previous work; (3) Demonstrating that integrating the local search algorithm SATLike into TT-Open-WBO-Inc as a preprocessor enables it to outperform the winners of MSE20 in all four incomplete tracks.

Publisher

IOS Press

Reference5 articles.

1. Old techniques in new ways: Clause weighting, unit propagation and hybridization for maximum satisfiability

2. Open-wbo-inc: Approximation strategies for incomplete weighted maxsat;Joshi;J. Satisf. Boolean Model. Comput.,2019

3. The sat4j library, release 2.2;Le Berre;JSAT,2010

4. A. Nadel, Solving MaxSAT with bit-vector optimization, in: SAT 2018, 2018, pp. 54–72.

5. Polarity and variable selection heuristics for SAT-based anytime MaxSAT;Nadel;J. Satisf. Boolean Model. Comput.,2020