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

SAT的简单算法组合

Simple Algorithm Portfolio for SAT

M. Nikoli\'c Faculty of Mathematics, University of Blegrade, Belgrade, Serbia Tel.: +381648650064 F. Mari\'c Faculty of Mathematics, University of Blegrade, Belgrade, Serbia P. Jani ci\'c Faculty of Mathematics, University of Blegrade, Belgrade, Serbia

Mladen Nikolic, Filip Maric, Predrag Janicic

摘要:

算法组合技术对于SAT的重要性早已被注意到,并且已经设计出了许多非常成功的系统,包括最成功的一个-- SATzilla。然而,所有这些系统都相当复杂(要理解、重新实现或修改)。在本文中,我们提出了一个新的算法组合SAT,这是非常简单的,但在同一时间如此有效,它优于SATzilla。对于一个新的SAT实例,我们的投资组合从训练集中找到它的k-最近邻居,并调用一个在这些实例中表现最好的求解器。我们的算法组合的主要特点是选择过程的局部性-SAT求解器的选择仅基于与输入类似的少数实例。

英文摘要:

The importance of algorithm portfolio techniques for SAT has long been noted, and a number of very successful systems have been devised, including the most successful one --- SATzilla. However, all these systems are quite complex (to understand, reimplement, or modify). In this paper we propose a new algorithm portfolio for SAT that is extremely simple, but in the same time so efficient that it outperforms SATzilla. For a new SAT instance to be solved, our portfolio finds its k-nearest neighbors from the training set and invokes a solver that performs the best at those instances. The main distinguishing feature of our algorithm portfolio is the locality of the selection procedure --- the selection of a SAT solver is based only on few instances similar to the input one.

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

↑