不完全MaxSAT的逼近策略
Approximation Strategies for Incomplete MaxSAT
摘要:
不完全MaxSAT求解的目的是快速找到一个解决方案,试图最小化未满足的软条款的权重之和,而不提供任何最优性保证。在本文中,我们提出了两个近似策略,以改善不完全MaxSAT解决。在其中一种策略中,我们将权重聚类,并用代表性权重近似它们。在另一种策略中,我们将最小化不可满足子句的权重之和的问题分解为多个最小化子问题。实验结果表明,近似策略可以用来找到比MaxSAT Evaluation 2017中的最佳不完整求解器更好的解决方案。
英文摘要:
Incomplete MaxSAT solving aims to quickly find a solution that attempts to minimize the sum of the weights of the unsatisfied soft clauses without providing any optimality guarantees. In this paper, we propose two approximation strategies for improving incomplete MaxSAT solving. In one of the strategies, we cluster the weights and approximate them with a representative weight. In another strategy, we break up the problem of minimizing the sum of weights of unsatisfiable clauses into multiple minimization subproblems. Experimental results show that approximation strategies can be used to find better solutions than the best incomplete solvers in the MaxSAT Evaluation 2017.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。