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

SLS算法长尾的证据

Evidence for Long-Tails in SLS Algorithms

Universität Ulm(乌尔姆大学)

Florian Wörz, Jan-Hendrik Lorenz

摘要:

随机局部搜索(SLS)是解决命题逻辑可满足性问题的一个成功范例。这一领域的最新发展涉及解决的不是原来的实例,而是修改后的,但逻辑上等价的一个。从经验上讲,这种技术被认为是有前途的,因为它提高了最先进的SLS求解器的性能。目前,对于这种修改技术如何影响SLS解算器的运行时间只有一个粗浅的了解。因此,我们对这个修改过程进行了建模,并对逻辑等效公式的难度进行了实证分析。我们的结果是双重的。首先,如果修改过程被视为随机过程,则对数正态分布完美地表征了硬度;这意味着硬度是长尾的。这意味着可以通过实现额外的重启机制来进一步改进修改技术。因此,作为第二个贡献,我们从理论上证明,所有表现出这种长尾属性的算法可以通过重新启动进一步改善。因此,可以增强采用这种修改技术的所有SAT求解器。

英文摘要:

Stochastic local search (SLS) is a successful paradigm for solving the satisfiability problem of propositional logic. A recent development in this area involves solving not the original instance, but a modified, yet logically equivalent one. Empirically, this technique was found to be promising as it improves the performance of state-of-the-art SLS solvers. Currently, there is only a shallow understanding of how this modification technique affects the runtimes of SLS solvers. Thus, we model this modification process and conduct an empirical analysis of the hardness of logically equivalent formulas. Our results are twofold. First, if the modification process is treated as a random process, a lognormal distribution perfectly characterizes the hardness; implying that the hardness is long-tailed. This means that the modification technique can be further improved by implementing an additional restart mechanism. Thus, as a second contribution, we theoretically prove that all algorithms exhibiting this long-tail property can be further improved by restarts. Consequently, all SAT solvers employing this modification technique can be enhanced.

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

↑