Overview and analysis of the SAT Challenge 2012 solver competition
Overview and analysis of the SAT Challenge 2012 solver competition
复制标题
DOI：
10.1016/j.artint.2015.01.002
复制
发表时间：
2015-06-01
影响因子：
14.4
通讯作者：
Sinz, Carsten
中科院分区：
文献类型：
--
作者：
Balint, Adrian;Belov, Anton;Sinz, Carsten
布尔可满足性问题(SAT)的程序，即SAT求解器，如今被用作广泛组合问题的核心决策过程。在过去的10-15年里，每年举行的求解器竞赛促进了SAT求解方面的进步。在这篇文章中，我们报道了2012年举行的主要SAT解算器比赛，SAT挑战赛2012。除了概述2012年SAT挑战赛是如何组织的之外，我们还深入分析了在比赛中取得的结果的关键方面。(C)2015爱思唯尔B.V.保留所有权利。
Programs for the Boolean satisfiability problem (SAT), i.e., SAT solvers, are nowadays used as core decision procedures for a wide range of combinatorial problems. Advances in SAT solving during the last 10-15 years have been spurred by yearly solver competitions. In this article, we report on the main SAT solver competition held in 2012, SAT Challenge 2012. Besides providing an overview of how SAT Challenge 2012 was organized, we present an in-depth analysis of key aspects of the results obtained during the competition. (C) 2015 Elsevier B.V. All rights reserved.