Table of Contents
Fetching ...

Proceedings of the 2025 XCSP3 Competition

Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca

TL;DR

The paper documents the 2025 XCSP$^3$ Competition, detailing problem selection, instance generation, and modeling approaches for CSP and COP tracks. It emphasizes novelty and scalable instance design, with most problems modeled in PyCSP$^3$ and organized under the XCSP$^3$-core framework, providing reproducible instance and model sets via dedicated ZIP archives. Key contributions include a transparent selection process, a structured catalog of problems across global constraints, and a concrete Accordion model example to illustrate the modeling pipeline. The work offers a rigorous benchmark infrastructure that benefits solver developers and benchmarking efforts, enabling consistent evaluation and comparability across competitions. Overall, the structured methodology and publicly available artifacts strengthen the constraint programming community's ability to assess solver performance on diverse, scalable workloads.

Abstract

This document represents the proceedings of the 2025 XCSP3 Competition. The results of this competition of constraint solvers were presented at CP'25 (31st International Conference on Principles and Practice of Constraint Programming).

Proceedings of the 2025 XCSP3 Competition

TL;DR

The paper documents the 2025 XCSP Competition, detailing problem selection, instance generation, and modeling approaches for CSP and COP tracks. It emphasizes novelty and scalable instance design, with most problems modeled in PyCSP and organized under the XCSP-core framework, providing reproducible instance and model sets via dedicated ZIP archives. Key contributions include a transparent selection process, a structured catalog of problems across global constraints, and a concrete Accordion model example to illustrate the modeling pipeline. The work offers a rigorous benchmark infrastructure that benefits solver developers and benchmarking efforts, enabling consistent evaluation and comparability across competitions. Overall, the structured methodology and publicly available artifacts strengthen the constraint programming community's ability to assess solver performance on diverse, scalable workloads.

Abstract

This document represents the proceedings of the 2025 XCSP3 Competition. The results of this competition of constraint solvers were presented at CP'25 (31st International Conference on Principles and Practice of Constraint Programming).

Paper Structure

This paper contains 10 sections, 1 table.