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

理解基于规则驱动的子句学习SAT求解器中的VSIDS分支启发式

Understanding VSIDS Branching Heuristics in Conflict-Driven Clause-Learning SAT Solvers

Jia Hui Liang, Vijay Ganesh, Ed Zulkoski, Atulan Zaman, Krzysztof Czarnecki

摘要:

算法驱动的子句学习SAT求解器的性能关键取决于可变状态独立衰减和(VSIDS)分支启发式。尽管VSIDS在近15年前被提出,并且此后提出了许多其他用于SAT求解的分支算法,但VSIDS仍然是最有效的分支算法之一。在本文中,我们通过回答以下关键问题来推进我们对VSIDS的理解。我们提出的第一个问题是“VSIDS选择添加碰撞的变量类有什么特别之处?“在回答这个问题时,我们发现VSIDS绝大多数都选择、碰撞和学习桥变量,桥变量定义为连接SAT实例社区结构中不同社区的变量。这是令人惊讶的,因为VSIDS是在社区结构和SAT求解器性能之间的联系被发现之前十多年发明的。此外,我们表明,VSIDS被视为一个排名功能强烈相关的时间图中心的措施。把这两个发现放在一起,我们得出结论,VSIDS挑选高中心性的桥梁变量。我们提出的第二个问题是“乘法衰变在使VSIDS如此有效方面发挥了什么作用?“我们表明,乘法衰减的行为就像指数移动平均(EMA),有利于持续发生冲突的变量(信号),而不是间歇发生的变量(噪声)。我们提出的第三个问题是“VSIDS是否在时间和空间上集中。“我们表明,VSIDS不成比例地从少数社区中挑选变量,这与随机分支启发式不同。我们将这些发现放在一起,发明了一种新的自适应VSIDS分支启发式算法,该算法比SAT竞赛2013基准测试中最知名的VSIDS变体之一解决了更多的实例。

英文摘要:

Conflict-Driven Clause-Learning SAT solvers crucially depend on the Variable State Independent Decaying Sum (VSIDS) branching heuristic for their performance. Although VSIDS was proposed nearly fifteen years ago, and many other branching heuristics for SAT solving have since been proposed, VSIDS remains one of the most effective branching heuristics. In this paper, we advance our understanding of VSIDS by answering the following key questions. The first question we pose is "what is special about the class of variables that VSIDS chooses to additively bump?" In answering this question we showed that VSIDS overwhelmingly picks, bumps, and learns bridge variables, defined as the variables that connect distinct communities in the community structure of SAT instances. This is surprising since VSIDS was invented more than a decade before the link between community structure and SAT solver performance was discovered. Additionally, we show that VSIDS viewed as a ranking function correlates strongly with temporal graph centrality measures. Putting these two findings together, we conclude that VSIDS picks high-centrality bridge variables. The second question we pose is "what role does multiplicative decay play in making VSIDS so effective?" We show that the multiplicative decay behaves like an exponential moving average (EMA) that favors variables that persistently occur in conflicts (the signal) over variables that occur intermittently (the noise). The third question we pose is "whether VSIDS is temporally and spatially focused." We show that VSIDS disproportionately picks variables from a few communities unlike, say, the random branching heuristic. We put these findings together to invent a new adaptive VSIDS branching heuristic that solves more instances than one of the best-known VSIDS variants over the SAT Competition 2013 benchmarks.

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

↑