arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.13085cs.AI
收藏

关于提高PB求解器的后跳水平

On Improving the Backjump Level in PB Solvers

LIX (Laboratoire d’Informatique de l’X), École Polytechnique(巴黎综合理工学院计算机实验室(LIX),巴黎综合理工学院)

Romain Wallon

摘要:

当前PB求解器实现了许多受现代SAT求解器的CDCL体系结构启发的技术,从而受益于其实际效率。然而,他们还需要处理这样一个事实,即当考虑PB约束时,这种架构所利用的许多属性不再为真。在本文中,我们专注于这些属性之一,即所谓的第一个唯一蕴涵点(1-UIP)的最优性。虽然这是众所周知的,学习冲突分析过程中产生的第一个断言子句,确保在SAT求解器中执行尽可能高的backjump,我们表明,在PB约束的存在下,没有这样的保证。我们还介绍和评估不同的方法,旨在提高backjump的水平,在冲突分析过程中确定,允许继续分析后,达到1-UIP。我们的实验表明,次优backjumps是相当常见的PB求解器,即使他们的影响求解器是不清楚的。

英文摘要:

Current PB solvers implement many techniques inspired by the CDCL architecture of modern SAT solvers, so as to benefit from its practical efficiency. However, they also need to deal with the fact that many of the properties leveraged by this architecture are no longer true when considering PB constraints. In this paper, we focus on one of these properties, namely the optimality of the so-called first unique implication point (1-UIP). While it is well known that learning the first assertive clause produced during conflict analysis ensures to perform the highest possible backjump in a SAT solver, we show that there is no such guarantee in the presence of PB constraints. We also introduce and evaluate different approaches designed to improve the backjump level identified during conflict analysis by allowing to continue the analysis after reaching the 1-UIP. Our experiments show that sub-optimal backjumps are fairly common in PB solvers, even though their impact on the solver is not clear.

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

↑