.png){kind=icon}
返回
The Configurable SAT Solver Challenge (CSSC)
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2016.09.006.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
It is well known that different solution strategies work well for different types of instances of hard combinatorial problems. As a consequence, most solvers for the propositional satisfiability problem (SAT) expose parameters that allow them to be customized to a particular family of instances. In the international SAT competition series, these parameters are ignored: solvers are run using a single default parameter setting (supplied by the authors) for all benchmark instances in a given track. While this competition format rewards solvers with robust default settings, it does not reflect the situation faced by a practitioner who only cares about performance on one particular application and can invest some time into tuning solver parameters for this application. The new Configurable SAT Solver Competition (CSSC) compares solvers in this latter setting, scoring each solver by the performance it achieved after a fully automated configuration step. This article describes the CSSC in more detail, and reports the results obtained in its two instantiations so far, CSSC 2013 and 2014. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Propositional satisfiability
Algorithm configuration
Empirical evaluation
Competition
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
引用论文
分享收藏Mutations affecting Transition-State Stabilization by Residues Coordinating Zinc at the Active Site of Cytidine Deaminase.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏A STUDY OF SPONTANEOUS MUTATION RATES AT TEN LOCI DETECTABLE BY STARCH GEL ELECTROPHORESIS IN DROSOPHILA MELANOGASTERGenetics
OAAI
GeneticsIF0
OAAI分享收藏分享收藏Does the PMSP connectionist model of single word reading learn to read in the same way as a child?
PREAI
分享收藏
查看更多内容