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

可满足性求解器的动态阶段选择策略

A Dynamic Phase Selection Strategy for Satisfiability Solvers

Donghua University(东华大学)

Jingchao Chen

摘要:

相位选择是基于冲突驱动DPLL的SAT解算器的一个重要环节。本文提出了一种新的相位选择策略,其中每个文字的权重被定义为其隐含文字静态权重之和。在搜索过程中,每个文字的隐含文字是动态计算的。因此,它被称为动态相位选择策略。通常,动态计算权重是耗时的。因此,到目前为止,没有SAT求解器成功地应用动态相位选择。由于我们的策略的隐含文字符合搜索过程,通常的两个观察文字方案可以应用在这里。因此,我们的动态相位选择的成本非常低。为了改进在SAT 2011竞赛中获得应用类金奖的Glucose 2.0,我们使用动态相位选择策略构建了五个相位选择方案。在SAT 2011的应用实例中,通过动态相位选择改进的Glucose明显优于原始Glucose。我们还在Lingeling上进行了实验,使用动态相位选择策略,并建立了两个相位选择方案。实验结果表明,改进的Lingeling算法优于原Lingeling算法。

英文摘要:

The phase selection is an important of a SAT Solver based on conflict-driven DPLL. This paper presents a new phase selection strategy, in which the weight of each literal is defined as the sum of its implied-literals static weights. The implied literals of each literal is computed dynamically during the search. Therefore, it is call a dynamic phase selection strategy. In general, computing dynamically a weight is time-consuming. Hence, so far no SAT solver applies successfully a dynamic phase selection. Since the implied literal of our strategy conforms to that of the search process, the usual two watched-literals scheme can be applied here. Thus, the cost of our dynamic phase selection is very low. To improve Glucose 2.0 which won a Gold Medal for application category at SAT 2011 competition, we build five phase selection schemes using the dynamic phase selection policy. On application instances of SAT 2011, Glucose improved by the dynamic phase selection is significantly better than the original Glucose. We conduct also experiments on Lingeling, using the dynamic phase selection policy, and build two phase selection schemes. Experimental results show that the improved Lingeling is better than the original Lingeling.

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

↑