进入正题,MaxSAT既然是SAT问题的扩展,那么很好理解的是它们之间的结构很相似,都是使用合取范式CNF,但还是有一些细小的规则上的差别。 MaxSAT好就好在,(它好个锤子)它可以分成很多类别,根据MaxSAT竞赛网站MaxSAT-evaluation来说,MaxSAT主要分为四大类: 不带权重的MaxSAT (Unweighted MaxSAT) 如果只说MAXSAT,我们一...
Josep Argelich, Chu Min Li, Felip Manya`, and Jordi Planes. Max-SAT Evaluation 2007, May 2007. URL http://www.maxsat07.udl.es.Josep Argelich, Chu Min Li, Felip Many`a, and Jordi Planes. Max-SAT Evaluation 2007, May 2007. URL http://www.maxsat07.udl.es....
UWrMaxSat is a relatively new MiniSat+-based solver participating in MaxSAT Evaluation 2019, where it ranked second places in both main tracks (weighted and unweighted). In MaxSAT Evaluation 2020 it won the weighted main track. It has been created recently at the University of Wrocław. It...
As benchmarks we used all 594 weighted and 607 unweighted instances from the complete track of the MaxSAT Evaluation 2022 [61], where an instance (F, O) is unweighted if all coefficients coeff (O, ) are equal. The data from our experiments can be found in [12]. Overhead of Proof ...
We present timed results on a subset of problem instances from the annual MaxSAT Evaluation's Incomplete Unweighted Track for the years 2018 to 2021. When allotted the same running time and CPU compute budget (but no TPUs), RbmSAT outperforms other participating solvers on problems drawn from...
MaxSAT是典型的NP难问题，具有很重要的理论和工业价值。MaxSAT的算法有两大类：完备算法以及启发式算法。本文研究的重点是MaxSAT的完备算法，完备算法的最大特点是需要考虑每一种可能解，所以在基于分支限界的MaxSAT算法中，为了更早更多的排除非最优解，在下界预估阶段使用单子句传播规则、推理规则、失败文字探测等...
years, as illustrated by their absence in the annual MaxSAT Evaluation since 2017. 译文:可能正是由于这一困难,近年来BnB的MaxSAT解决方案并没有显著提速,从2017年以来的年度MaxSAT评估中就可以看出这一点。 In this paper, we propose an original approach that allows a BnB MaxSAT solver to learn ...
近年来,MaxSAT evaluation网站上涌现了很多先进的MaxSAT 求解器, M ax S AT的求解技术与相比五年前相比已有长足的发展。 M ax S AT问题的完备算法能保证其解的最优性质,但是缺点是找到这个最优解在时间上的代价很大,需要遍历整个解空间,其时间复杂度是指数级别的,所以这类算法对于大规模实例的求解比较困难,这...
Experimental results obtained on industrial instances from the most recent MaxSAT evaluation, in- dicate that the proposed algorithm achieves increased robustness and improves overall performance, being capable of solving more instances than state-of-the- art MaxSAT solvers....
We present an evaluation of Max-SAT and Pseudo-Boolean (PB) solvers on a novel and interesting application domain involving planning problems with preferences expressed on actions preconditions and/or goals. These are over-subscription planning problems, i.e., planning problems in which not all the...