On these pages we will collect information on affiliated events, including colocated conferences, workshops, competitions and the doctoral program. This page will be regularly updated with more information.

Colocated Conferences

SAT 2025 will colocate with:

Summer School

The SAT/SMT/AR summer school aims to bring a select group of students up to speed quickly in this exciting research area. The school continues the successful line of Summer Schools that ran from 2011 to 2024. The 2025 summer school will take place August 6 - 8 in St. Andrews

Organizers: Joan Espasa Arxer, Ian Gent, Ruth Hoffmann
Webpage: https://sat-smt-ar-school.gitlab.io/www/2025/

Doctoral Program

The Joint CP/SAT Doctoral Programme (DP) is open to all research students, including past participants, who are conducting research related to constraint programming and satisfiability. The goal is to provide an informal environment for networking, presenting and discussing ongoing work, and receiving feedback from both fellow research students and experts in the field. Participation requires a paper submission to the DP, reviewing other submissions to the DP and attendance in person.

Organizers: Katalin Fazekas, Mun See Chang
Webpage: https://satcpdp25.github.io/

Workshops

Satisfiability Modulo Theories (SMT)

The 23rd International Workshop on Satisfiability Modulo Theories (SMT) aims to bring together researchers and users of SMT tools and techniques.

Program Chairs: Sophie Tourret, Jochen Hoenicke
Webpage: https://smt-workshop.cs.uiowa.edu/2025/index.shtml

Pragmatics of SAT

The aim of the Pragmatics of SAT (PoS) workshop series is to provide a venue for researchers working on designing and/or applying Boolean satisfiability (SAT) solvers and related solver technologies, including but not restricting to satisfiability modulo theories (SMT), answer set programming (ASP), and constraint programming (CP) as well as their optimization counterparts, to meet, communicate, and discuss latest results.

Organizers: Mikoláš Janota, and Aina Niemetz
Webpage: https://www.pragmaticsofssat.org/2025/

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.

Organizers: 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.

Organizers: 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.

Organizers: Arijit Shaw, Markus Hecher, Johannes K. Fichte
Webpage: https://mccompetition.org/index.html

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/