Configurable SAT Solver Challenge (CSSC) 2014
CALL FOR CONTRIBUTIONS Configurable SAT Solver Challenge (CSSC) 2014 Event affiliated with SAT 2014 conference July 14 - 17, 2014, Vienna, Austria
Most modern SAT solvers have a large number of parameters that can be altered to adjust their behavior and performance. Following last year’s inaugural Configurable SAT Solver Challenge (CSSC), we will hold CSSC 2014, a competitive event that assesses the peak performance of such parametric solvers (i.e. performance with optimized parameters). Thereby, CSSC recognizes that the value of a SAT solver for a given application is often is due to its customizability rather than just its performance in a default configuration.
To obtain a good approximation of the peak performance attainable in practice, we will use a fixed computational budget to optimize parameter settings with state-of-the-art software (so-called “algorithm configuration” procedures) recently developed by several groups.
We will reward SAT solvers that can be flexibly configured to perform well in different circumstances (as opposed to having one single best configuration). The results will be presented at this year’s SAT conference.
We invite submissions of both configurable SAT solvers and benchmark instance generators. Although we will accept closed-source solvers, only open-source submissions will be eligible for awards. To minimize the overhead for solver designers, the deadlines are arranged to fall just after those of the SAT competition.
More details about the submission process, and the rules of the competition, can be found on our website: http://aclib.net/cssc2014/
May 18: submission deadline for solvers and benchmarks
July 14-17: presentation of results during SAT 2013 conference
Frank Hutter (University of Freiburg)
Marius Lindauer (University of Freiburg)
Sam Bayless (University of British Columbia)
Holger Hoos (University of British Columbia)
Kevin Leyton-Brown (University of British Columbia)