The Configurable SAT Solver Challenge (CSSC)

05/05/2015
by   Frank Hutter, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/31/2011

SATzilla: Portfolio-based Algorithm Selection for SAT

It has been widely observed that there is no single "dominant" SAT solve...
research
05/30/2022

A portfolio-based analysis method for competition results

Competitions such as the MiniZinc Challenges or the SAT competitions hav...
research
10/02/2015

Implementing Efficient All Solutions SAT Solvers

All solutions SAT (AllSAT for short) is a variant of propositional satis...
research
04/22/2022

New Core-Guided and Hitting Set Algorithms for Multi-Objective Combinatorial Optimization

In the last decade, a plethora of algorithms for single-objective Boolea...
research
12/11/2021

Branching Strategy Selection Approach Based on Vivification Ratio

The two most effective branching strategies LRB and VSIDS perform differ...
research
08/09/2023

Competitions in AI – Robustly Ranking Solvers Using Statistical Resampling

Solver competitions play a prominent role in assessing and advancing the...
research
09/14/2017

Warmstarting of Model-based Algorithm Configuration

The performance of many hard combinatorial problem solvers depends stron...

Please sign up or login with your details

Forgot password? Click here to reset