SAT Competition 2020

作者:

摘要

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.

论文关键词:SAT,Boolean satisfiability,SAT Competition,SAT solvers,Empirical evaluation,Benchmarking

论文评审过程:Received 7 February 2021, Revised 28 June 2021, Accepted 27 July 2021, Available online 4 August 2021, Version of Record 19 August 2021.

论文官网地址:https://doi.org/10.1016/j.artint.2021.103572