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

具有多次重启和有界宽度分辨率的子句-学习算法

Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution

Vienna University of Technology(维也纳工业大学);University of California at Berkeley(加州大学伯克利分校)

Albert Atserias, Johannes Klaus Fichte, Marc Thurley

摘要:

我们提供了一个新的理解,一些方面的实际SAT求解器是基于DPLL与单位子句传播,子句学习,并重新启动。我们这样做是通过分析一个具体的算法,我们声称是忠实于实际的求解器做什么。特别是,在做出任何新的决定或重新开始之前,求解器重复应用单位分辨率规则,直到饱和,并且除了一些内部随机性之外,不留下任何组件受非确定性的支配。我们证明了一个可能令人惊讶的事实,即尽管求解器不是为它明确设计的,但在不超过O(n^2k+2)次冲突和重新启动后,它很有可能最终表现为宽度k分辨率,其中n是变量的数量。换句话说,宽度k分辨可以被认为是O(n^2k+2)的单位分辨规则的重新开始。

英文摘要:

We offer a new understanding of some aspects of practical SAT-solvers that are based on DPLL with unit-clause propagation, clause-learning, and restarts. We do so by analyzing a concrete algorithm which we claim is faithful to what practical solvers do. In particular, before making any new decision or restart, the solver repeatedly applies the unit-resolution rule until saturation, and leaves no component to the mercy of non-determinism except for some internal randomness. We prove the perhaps surprising fact that, although the solver is not explicitly designed for it, with high probability it ends up behaving as width-k resolution after no more than O(n^2k+2) conflicts and restarts, where n is the number of variables. In other words, width-k resolution can be thought of as O(n^2k+2) restarts of the unit-resolution rule with learning.

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

↑