SAT Race 2015

被引:26
作者
Balyo, Tomas [1 ]
Biere, Armin [2 ]
Iser, Markus [1 ]
Sinz, Carsten [1 ]
机构
[1] Karlsruhe Inst Technol, Dept Informat, Bldg 50-34,Fasanengarten 5, D-76131 Karlsruhe, Germany
[2] Johannes Kepler Univ Linz, Fac Engn & Nat Sci, Altenbergerstr 69, A-4040 Linz, Austria
关键词
SAT; Competition; SAT-Race;
D O I
10.1016/j.artint.2016.08.007
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Boolean satisfiability (SAT) solving is one of the most competitive research areas of theoretical computer science. The performance of state-of-the-art SAT solvers has been continuously improving in the last decades and has reached a level where SAT solvers can be employed to solve real world problems in fields such as hardware and software verification, automated planning and many others. One of the important driving forces of this progress are the yearly organized (since 2002) SAT competitions. In this paper we describe the 2015 SAT Race that featured the traditional sequential and parallel tracks (with 64 core computers) and introduced the Incremental Library Track, which is particularly interesting for developers of SAT based applications. We describe the 2015 SAT Race and provide a detailed analysis of its results. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:45 / 65
页数:21
相关论文
共 38 条
[1]  
[Anonymous], 1996, American Mathematical Soc.
[2]  
Audemard Gilles, 2013, Theory and Applications of Satisfiability Testing - SAT 2013. 16th International Conference. Proceedings. LNCS 7962, P309
[3]  
Audemard G, 2014, LECT NOTES COMPUT SC, V8561, P197, DOI 10.1007/978-3-319-09284-3_15
[4]  
Audemard G, 2010, AAAI CONF ARTIF INTE, P15
[5]  
Audemard G, 2009, 21ST INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI-09), PROCEEDINGS, P399
[6]  
Biere A., 2013, P SAT COMP 2013, V51
[7]  
Biere A., 2014, Department of Computer Science Series of Publications B, VB-2014-2, P39
[9]  
Buro M., 1992, FACHBEREICH MATH INF
[10]  
Chen J., 2015, MINISAT BCD ABCDSAT