SAT Competition 2020
Nils Froleyks, Marijn J. H. Heule, Markus Iser, Matti Järvisalo, Martin Suda
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.
Topics & Concepts
Competition (biology)Boolean satisfiability problemBenchmark (surveying)Computer scienceSatisfiabilitySelection (genetic algorithm)Propositional calculusTheoretical computer scienceMaximum satisfiability problemArtificial intelligenceAlgorithmProgramming languageBoolean functionEcologyBiologyGeographyGeodesyConstraint Satisfaction and OptimizationAI-based Problem Solving and PlanningMachine Learning and Algorithms