no code implementations • 10 Dec 2023 • Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca
This document represents the proceedings of the 2023 XCSP3 Competition.
1 code implementation • 6 Jan 2023 • Christophe Lecoutre
Constraint Programming (CP) is a useful technology for modeling and solving combinatorial constrained problems.
no code implementations • 2 Sep 2022 • Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca
This document represents the proceedings of the 2022 XCSP3 Competition.
1 code implementation • 1 Sep 2020 • Frédéric Boussemart, Christophe Lecoutre, Gilles Audemard, Cédric Piette
In this document, we introduce XCSP3-core, a subset of XCSP3 that allows us to represent constraint satisfaction/optimization problems.
2 code implementations • 1 Sep 2020 • Christophe Lecoutre, Nicolas Szczepanski
In this document, we introduce PyCSP$3$, a Python library that allows us to write models of combinatorial constrained problems in a declarative manner.
no code implementations • 17 Dec 2018 • Christophe Lecoutre, Olivier Roussel
This document represents the proceedings of the 2018 XCSP3 Competition.
no code implementations • 10 Nov 2016 • Frederic Boussemart, Christophe Lecoutre, Gilles Audemard, Cédric Piette
We propose a major revision of the format XCSP 2. 1, called XCSP3, to build integrated representations of combinatorial constrained problems.
no code implementations • JEPTALNRECITAL 2016 • Jean-Philippe Prost, R{\'e}mi Coletta, Christophe Lecoutre
Cet article pr{\'e}sente un processus de compilation d{'}une grammaire de propri{\'e}t{\'e}s en une contrainte en extension.
no code implementations • 22 Apr 2016 • Jordan Demeulenaere, Renaud Hartert, Christophe Lecoutre, Guillaume Perez, Laurent Perron, Jean-Charles Régin, Pierre Schaus
In this paper, we describe Compact-Table (CT), a bitwise algorithm to enforce Generalized Arc Consistency (GAC) on table con- straints.
no code implementations • 16 Jan 2014 • Christophe Lecoutre, Stephane Cardon, Julien Vion
In this paper, we propose a comprehensive study of second-order consistencies (i. e., consistencies identifying inconsistent pairs of values) for constraint satisfaction.
no code implementations • 19 Apr 2013 • Christophe Lecoutre, Nicolas Paris, Olivier Roussel, Sébastien Tabary
Usual techniques to solve WCSP are based on cost transfer operations coupled with a branch and bound algorithm.
1 code implementation • 13 Feb 2009 • Olivier Roussel, Christophe Lecoutre
We propose a new extended format to represent constraint networks using XML.