We address Partial MaxSAT (PMS) and Weighted PMS (WPMS), two practical generalizations of the MaxSAT problem, and propose a local search algorithm called BandMaxSAT, that applies a multi-armed bandit to guide the search direction, for these problems. The bandit in our method is associated with all the soft clauses in the input (W)PMS instance. Each arm corresponds to a soft clause. The bandit model can help BandMaxSAT to select a good direction to escape from local optima by selecting a soft clause to be satisfied in the current step, that is, selecting an arm to be pulled. We further propose an initialization method for (W)PMS that prioritizes both unit and binary clauses when producing the initial solutions. Extensive experiments demonstrate that BandMaxSAT significantly outperforms the state-of-the-art (W)PMS local search algorithm SATLike3.0. Specifically, the number of instances in which BandMaxSAT obtains better results is about twice that obtained by SATLike3.0. We further combine BandMaxSAT with the complete solver TT-Open-WBO-Inc. The resulting solver BandMaxSAT-c also outperforms some of the best state-of-the-art complete (W)PMS solvers, including SATLike-c, Loandra and TT-Open-WBO-Inc.
翻译:我们处理部分MaxSAT(PMS)和加权PMS(WPMS),这是对MaxSAT问题的两个实用的概括,我们提出一个叫做BandMaxSAT的本地搜索算法,该算法使用多武装土匪来指导搜索方向,解决这些问题。我们的方法中的土匪与输入(W)PMS(PMS)中的所有软条款有关。每个手臂对应一个软条款。土匪模型可以帮助BandMaxSAT选择一个好的方向,从本地的Popima中逃脱,方法是选择一个在目前步骤中满足的软条款,即选择一个要拉动的手臂。我们进一步为(W)PMS提出一个初始方法,该方法在产生初步解决方案时既优先考虑单元条款,又优先考虑二元条款。广泛的实验表明,BandMaxSAT(W)大大优于输入(W)的状态(SAT)当地搜索算算算算法。具体来说,BandMaxSATSAT获得更好的结果大约是SAT3.0所获得的两倍。我们进一步将BandMaxSATSATSAT(WSAT)与完整解算算算得的S-O-O-O-ROSAT-ROMMM-ROM-ROM-ROM-S-S-S-ROP-S-S-S-BAS-BAS-ROPM-S-ROMS-S-S-S-S-S-ROM-S-S-S-S-S-P-S-S-S-P-S-S-S-S-S-S-S-P-S-S-S-S-P-S-S-S-P-S-S-S-S-S-S-P-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-SD-S-S-S-S-P-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-S-