cs.AINov 17, 2026
SaveProceedings of the 2026 XCSP3 Competition
Organizations: CRIL University of Artois & CNRS France
Abstract
This document constitutes the proceedings of the 2026 XCSP3 Competition. The results of this competition of constraint solvers were presented at FLOC (Federated Logic Conference) 2026 Olympic Games, held in Lisbon, Portugal from 20th to 29th July, 2026.
Figures & tables
| CSP Problems | Global Constraints | |
| AllDifferentPathological | allDifferent | |
| Antichain1 | count , lex | |
| Antichain2 | element , lex | |
| BIBD2 | cardinality , lex , nValues | |
| Collatz | allDifferent | |
| ColoredGrid | allDifferent , lex |
Table 1.1: Selected Problems for the main tracks of the 2026 Competition. When table is followed by ( ), it means that starred tables are involved.
| Problem | Goal | Exploration | Timeout |
|---|---|---|---|
| CSP | one solution | sequential | 30 minutes |
| COP | best solution | sequential | 30 minutes |
| Fast COP | best solution | sequential | 3 minutes |
| // COP | best solution | parallel | 30 minutes |
Table 4.1: Standard Tracks.
| Problem | Goal | Exploration | Timeout |
|---|---|---|---|
| Mini CSP | one solution | sequential | 30 minutes |
| Mini COP | best solution | sequential | 30 minutes |
Table 4.2: Mini-Solver Tracks.
More in this topic
Constraint Satisfaction
Constraint satisfaction studies how to find or optimize assignments that obey interacting rules across discrete and structured problems.
See all 91 papers