Overview and analysis of the SAT Challenge 2012 solver competition

Artif. Intell.(2015)

引用 50|浏览40
暂无评分
摘要
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.
更多
查看译文
关键词
solver ranking,empirical analysis,sat solvers,boolean satisfiability,competitions
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要