SAT Competitions
The purpose of the competition is to identify new challenging benchmarks and to promote new solvers for the propositional satisfiability problem (SAT) as well as to compare them with state-of-the-art solvers. We strongly encourage people thinking about SAT-based techniques in their area (planning, hardware or software verification, etc.) to submit benchmarks to be used for the competition. The result of the competition will be a good indicator of the current feasibility of such approach. The competition will be completely automated using the SAT-Ex system.
SAT Competitions The International SAT Competition Web Page Current Competition SAT 2026 Competition Organizers Katalin Fazekas , Marijn Heule , Ashlin Iser Past Competitions, Races and Evaluations SAT 2025 Competition Organizers Katalin Fazekas , Marijn Heule , Ashlin Iser SAT 2024 Competition Organizers Marijn Heule , Ashlin Iser Matti Järvisalo , Martin Suda SAT 2023 Competition Organizers Marijn Heule , Matti Järvisalo , Martin Suda , Ashlin Iser , Tomáš Balyo SAT 2022 Competition Organizers Marijn Heule , Matti Järvisalo , Martin Suda , Ashlin Iser , Tomá
Explore this link on the map →saved by
related reading
- Asymmetry of verification and verifier’s rule - Jason Weijasonwei.net
- ALE-Bench: A Benchmark for Long-Horizon Objective-Driven Algorithm Engineering | alphaXivalphaxiv.org
- What's new | Updates on my research and expository papers, discussion of open problems, and other maths-related topics. By Terence Taoterrytao.wordpress.com
- ML Contestsmlcontests.com
- TPTPtptp.org
- COMP 598 Fall 2020 - Proof Complexitycs.mcgill.ca
- Planar SAT - Wikipediaen.wikipedia.org
- Why SAT Is Hardmatklad.github.io
- GitHub - konstin/sudoku-in-python-packaging: Sudoku solving in python packaging · GitHubgithub.com
- Competitive Programmer's Handbookcses.fi
- Kaggle Solutionsfarid.one
- P versus NP problem - Wikipediaen.wikipedia.org