arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1505.02405cs.AI
收藏

利用基于解析的表示法求解MaxSAT

Exploiting Resolution-based Representations for MaxSAT Solving

INESC-ID;Instituto Superior Técnico, Universidade de Lisboa(里斯本大学高等技术学院);University of Oxford(牛津大学)

Miguel Neves, Ruben Martins, Mikoláš Janota, Inês Lynce, Vasco Manquinho

摘要:

最新的MaxSAT算法依赖于对SAT求解器的连续调用,以找到最优解。特别是,一些算法利用SAT求解器的能力来识别不可满足的子公式。通常,这些MaxSAT算法表现得更好,当小的不可满足的子公式被发现早期。然而,在许多问题实例中并非如此,因为在每次调用中,整个公式都被提供给SAT求解器。在本文中,我们提出了分区的MaxSAT公式使用基于分辨率的图形表示。然后,通过使用从公式的图形表示中提取的邻近度量来迭代地连接分区。实验结果表明,该方法进一步提高了MaxSAT求解器的性能,使其能够最优地求解大量工业问题实例。

英文摘要:

Most recent MaxSAT algorithms rely on a succession of calls to a SAT solver in order to find an optimal solution. In particular, several algorithms take advantage of the ability of SAT solvers to identify unsatisfiable subformulas. Usually, these MaxSAT algorithms perform better when small unsatisfiable subformulas are found early. However, this is not the case in many problem instances, since the whole formula is given to the SAT solver in each call. In this paper, we propose to partition the MaxSAT formula using a resolution-based graph representation. Partitions are then iteratively joined by using a proximity measure extracted from the graph representation of the formula. The algorithm ends when only one partition remains and the optimal solution is found. Experimental results show that this new approach further enhances a state of the art MaxSAT solver to optimally solve a larger set of industrial problem instances.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑