arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1310.2298cs.AI
收藏

基于SAT的MaxSAT预处理(扩展版)

SAT-based Preprocessing for MaxSAT (extended version)

IST/INESC-ID, Technical University of Lisbon(里斯本技术大学高等技术学院/INESC-ID)

Anton Belov, Antonio Morgado, Joao Marques-Silva

摘要:

MaxSAT问题的工业实例的最新算法依赖于对SAT求解器的迭代调用。预处理是加速可满足性问题求解的关键,而预处理的关键技术依赖于分解和包容消除的应用。此外,还经常使用保持可满足性的子句消除程序。由于MaxSAT计算通常涉及大量的SAT调用,因此我们感兴趣的是MaxSAT问题的输入实例是否可以预先预处理,即在运行MaxSAT求解器之前,而不是(或除了)在每次迭代SAT求解器调用期间。这种设置的关键要求是预处理必须合理,即在预处理实例上执行MaxSAT算法后,可以正确有效地重建解决方案。虽然,正如我们在本文中所展示的,某些条款消除程序是健全的MaxSAT,这是众所周知的,这是不是解决方案和包容消除的情况。在本文中,我们将展示如何适应这些预处理技术的MaxSAT。为了实现这一目标,我们重铸的MaxSAT问题在最近推出的标记CNF框架,并表明,在框架内的预处理技术可以应用健全。此外,我们表明,MaxSAT算法重申的框架有一个自然的实现上的增量SAT求解器。我们评估的MaxSAT算法WMSU 1在这种设置的原型实现,证明预处理的有效性,并显示整体改进的非增量版本的算法对某些类的问题。

英文摘要:

State-of-the-art algorithms for industrial instances of MaxSAT problem rely on iterative calls to a SAT solver. Preprocessing is crucial for the acceleration of SAT solving, and the key preprocessing techniques rely on the application of resolution and subsumption elimination. Additionally, satisfiability-preserving clause elimination procedures are often used. Since MaxSAT computation typically involves a large number of SAT calls, we are interested in whether an input instance to a MaxSAT problem can be preprocessed up-front, i.e. prior to running the MaxSAT solver, rather than (or, in addition to) during each iterative SAT solver call. The key requirement in this setting is that the preprocessing has to be sound, i.e. so that the solution can be reconstructed correctly and efficiently after the execution of a MaxSAT algorithm on the preprocessed instance. While, as we demonstrate in this paper, certain clause elimination procedures are sound for MaxSAT, it is well-known that this is not the case for resolution and subsumption elimination. In this paper we show how to adapt these preprocessing techniques to MaxSAT. To achieve this we recast the MaxSAT problem in a recently introduced labelled-CNF framework, and show that within the framework the preprocessing techniques can be applied soundly. Furthermore, we show that MaxSAT algorithms restated in the framework have a natural implementation on top of an incremental SAT solver. We evaluate the prototype implementation of a MaxSAT algorithm WMSU1 in this setting, demonstrate the effectiveness of preprocessing, and show overall improvement with respect to non-incremental versions of the algorithm on some classes of problems.

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

↑