is a competitive event for solvers of the Boolean Satisfiability (SAT) problem. It is organized as a satellite event to the and stands in the tradition of the yearly SAT Competitions and SAT-Races / Challenges.
The area of SAT Solving has seen tremendous progress over the last years. Many problems (e.g. in hardware and software verification) that seemed to be completely out of reach a decade ago can now be handled routinely. Besides new algorithms and better heuristics, refined implementation techniques turned out to be vital for this success.
To keep up the driving force in improving SAT solvers, we want to motivate implementors to present their work to a broader audience and to compare it with that of others.
will consist of the following tracks*:
- Main Track (with No-Limits and CaDiCaL-Hack sub-tracks)
- Application Track: Cryptography
- Incremental Library Track
- Parallel Track
- Cloud Track
* Tracks with less than 3 participants will be canceled.
|Registration Opens:||March 1|
|Benchmark Submission Deadline|
|Solver Submission Deadline:|
|Announcement of Results:||At the|
Researchers from both academia and industry are invited to submit their solvers and benchmarks to .