Competitions
The following competitions and challenges will be held as part of the conferences.
The MiniZinc Challenge
The MiniZinc Challenge is an annual competition of constraint programming solvers on a variety of benchmarks. It has been held every year since 2008. The 15th MiniZinc Challenge will be held as part of CP 2025.
Judges: Jimmy H.M. Lee, Barry O'Sullivan, Roland Yap
Webpage: https://www.minizinc.org/challenge/2025/
The XCSP Competition
The XCSP Competition 2025 will be held as part of CP 2025. Details to follow.
Webpage: https://www.xcsp.org/competitions/
The SAT Competition
SAT Competition 2025 is a competitive event for solvers of the Boolean Satisfiability (SAT) problem. To keep up the driving force in improving SAT solvers, we want to motivate implementers to present their work to a broader audience and to compare it with that of others. Researchers from both academia and industry are invited to submit their solvers and benchmarks.
Organisers: Katalin Fazekas, Marijn Heule, Markus Iser
Webpage: https://satcompetition.github.io/2025/
The Pseudo-Boolean Competition
The goal of the Pseudo-Boolean Competition is to assess the state of the art in the field of pseudo-Boolean solvers, in the same spirit as the previous competitions and evaluations. This edition will be quite similar to the reboot of the Pseudo-Boolean Competition series in 2024, but we will use the opportunity to make some minor revisions of the set-up.
Organisers: Olivier Roussel
Webpage: https://www.cril.univ-artois.fr/PB25/
The Model Counting Competition
The 6th Competition on Model Counting (MC 2025) is a competition to deepen the relationship between latest theoretical and practical development on the various model counting problems and their practical applications. It targets the problem of counting the number of models of a Boolean formula.
Organisers: Arijit Shaw, Markus Hecher, Johannes K. Fichte
Webpage: https://mccompetition.org/