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

设计新的阶段选择启发式算法

Designing New Phase Selection Heuristics

Arijit Shaw, Kuldeep S. Meel

摘要:

基于CDCL的SAT求解器已经改变了自动推理领域,因为它们在处理来自不同领域的问题时表现出的效率。CDCL解算器的成功归功于巧妙的逻辑设计,使不同组件能够紧密耦合。其中一个核心组件是相位选择,其中求解器在分支期间决定要针对给定变量探索的分支的极性。大多数最先进的CDCL SAT求解器采用相位节省作为相位选择启发式算法,这是为了解决远回溯带来的潜在效率低下问题。鉴于CDCL求解器中时间回溯的出现,我们重新审视了相位保存的效率。我们的实证评估得出了一个令人惊讶的结论:在时间回溯过程中使用相位保存和极性的随机选择导致在解决的实例和PAR-2得分方面无法区分的运行时性能。我们引入衰减极性分数(DPS)来捕获变量所获得的极性的趋势,并且在观察到由于DPS而缺乏性能改进时,我们转向一种更复杂的启发式方法来捕获文字的活动和极性的趋势:文字状态独立衰减和(LSIDS)。我们发现2019年获胜的SAT求解器Maple_LCM_Dist_ChronoBTv3,使用LSIDS增强解决了6个以上的实例,同时实现了PAR-2分数减少125秒以上,这在SAT竞赛中是一个显着的改进。

英文摘要:

CDCL-based SAT solvers have transformed the field of automated reasoning owing to their demonstrated efficiency at handling problems arising from diverse domains. The success of CDCL solvers is owed to the design of clever heuristics that enable the tight coupling of different components. One of the core components is phase selection, wherein the solver, during branching, decides the polarity of the branch to be explored for a given variable. Most of the state-of-the-art CDCL SAT solvers employ phase-saving as a phase selection heuristic, which was proposed to address the potential inefficiencies arising from far-backtracking. In light of the emergence of chronological backtracking in CDCL solvers, we re-examine the efficiency of phase saving. Our empirical evaluation leads to a surprising conclusion: The usage of phase saving and random selection of polarity during chronological backtracking leads to indistinguishable runtime performance in terms of instances solved and PAR-2 score. We introduce Decaying Polarity Score (DPS) to capture the trend of the polarities attained by the variable, and upon observing lack of performance improvement due to DPS, we turn to a more sophisticated heuristic seeking to capture the activity of literals and the trend of polarities: Literal State Independent Decaying Sum (LSIDS). We find the 2019 winning SAT solver, Maple_LCM_Dist_ChronoBTv3, augmented with LSIDS solves 6 more instances while achieving a reduction of over 125 seconds in PAR-2 score, a significant improvement in the context of the SAT competition.

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

↑