Thirty First Conference on Principles and Practice of Constraint Programming

The 31st International Conference on Principles and Practice of Constraint Programming (CP 2025) is the flagship venue for research on constraint programming, a declarative paradigm for solving combinatorial problems by specifying what must hold rather than how to compute a solution. The program covers constraint propagation algorithms, global constraints, hybrid CP-SAT and CP-MIP solvers, search heuristics, modeling languages, and applications in scheduling, planning, configuration, and combinatorial optimization.

CP 2025 draws together AI researchers, operations researchers, mathematical programmers, and software engineers who need powerful declarative tools for solving hard combinatorial problems at scale. The conference is notable for bridging theory and practice: algorithmic advances in constraint solving directly enable industrial applications in logistics, manufacturing scheduling, and resource allocation, making it essential reading for both theoreticians developing new propagation algorithms and practitioners deploying constraint solvers in production systems.