201. SAT Competition 2020
- Author
-
Markus Iser, Martin Suda, Marijn J. H. Heule, Nils Froleyks, Matti Järvisalo, Department of Computer Science, Helsinki Institute for Information Technology, and Constraint Reasoning and Optimization research group / Matti Järvisalo
- Subjects
Linguistics and Language ,Empirical data ,Theoretical computer science ,Computer science ,02 engineering and technology ,Language and Linguistics ,Boolean satisfiability ,Competition (economics) ,Artificial Intelligence ,020204 information systems ,0202 electrical engineering, electronic engineering, information engineering ,Empirical evaluation ,Selection (genetic algorithm) ,Series (mathematics) ,SAT solvers ,ALGORITHMS ,DATA processing & computer science ,SAT Competition ,SOLVERS ,Benchmarking ,113 Computer and information sciences ,Satisfiability ,Benchmark (computing) ,SAT ,SATISFIABILITY ,020201 artificial intelligence & image processing ,ddc:004 ,Boolean satisfiability problem - Abstract
The SAT Competitions constitute a well-established series of yearly open international algorithm implementation competitions, focusing on the Boolean satisfiability (or propositional satisfiability, SAT) problem. In this article, we provide a detailed account on the 2020 instantiation of the SAT Competition, including the new competition tracks and benchmark selection procedures, overview of solving strategies implemented in top-performing solvers, and a detailed analysis of the empirical data obtained from running the competition. (C) 2021 The Authors. Published by Elsevier B.V.
- Published
- 2021
- Full Text
- View/download PDF