SAT Competition 2020

2021/08/04 by Nils Froleyks, Marijn J. H. Heule, Marijn Heule +5 · 8 citations
Computer Science · #Constraint Satisfaction and Optimization #AI-based Problem Solving and Planning #Machine Learning and Algorithms

paper · doi:10.1016/j.artint.2021.103572

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.

Cited by

• The Quantum Optimization Benchmarking Library
• Autonomous Code Evolution Meets NP-Completeness
• Efficiently Ranking Software Variants with Minimal Benchmarks
• Approximate SMT Counting Beyond Discrete Domains
• Too much information: Why CDCL solvers need to forget learned clauses. [europepmc]
• Computing high-degree polynomial gradients in memory. [europepmc]
• Producing Proofs of Unsatisfiability with Distributed Clause-Sharing SAT Solvers. [europepmc]
• The Quantum Optimization Benchmarking Library. [europepmc]

Related

• The Configurable SAT Solver Challenge (CSSC)
• Self-Satisfied: An end-to-end framework for SAT generation and prediction
• The VLSAT-2 Benchmark Suite
• The VLSAT-1 Benchmark Suite
• SAT solving techniques: a bibliography