Parallel Resolution of the Satisfiability Problem: A Survey
Parallel Resolution of the Satisfiability Problem: A Survey
复制标题
满意度问题的并行解决：一项调查
DOI：
10.1002/9780470053928.ch5
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
Daniel Singer
中科院分区：
文献类型：
--
作者：
Daniel Singer
在过去的几年中，命题可满足性求解器的性能取得了巨大的进步，因此，命题可满足性求解器在工业中得到了广泛的应用。尽管取得了这些进展，但人们仍然强烈要求提高SAT算法的效率，以解决更困难和更大的问题。不幸的是，大多数现代求解器是顺序的，并行的较少。我们的目的是回顾近十年来使用DPLL解算器在SAT并行分辨率方面的工作，DPLL解算器是最广泛使用的完整解算器。
The past few years have seen enormous progress in the performance of propositional satisfiability (SAT) solvers, and consequently SAT solvers are widely used in industry for many applications. In spite of this progress, there is strong demand for higher SAT algorithms efficiency to solve harder and larger problems. Unfortunately, most modern solvers are sequential and fewer are parallel. Our intention is to review the work of this last decade on parallel resolution of SAT with DPLL solvers which are the most widely used complete ones.