67 citations · 111 across the 9 of their papers we have counts for
11 papers
ACE, a generic constraint solver
Christophe Lecoutre
Constraint Programming (CP) is a useful technology for modeling and solving combinatorial constrained problems. On the one hand, on can use a library like PyCSP3 for easily modelin…
Proceedings of the 2022 XCSP3 Competition
Gilles Audemard, Christophe Lecoutre, Emmanuel Lonca
This document represents the proceedings of the 2022 XCSP3 Competition. The results of this competition of constraint solvers were presented at FLOC (Federated Logic Conference) 20…
XCSP3-core: A Format for Representing Constraint Satisfaction/Optimization Problems
Frédéric Boussemart, Christophe Lecoutre, Gilles Audemard +1
In this document, we introduce XCSP3-core, a subset of XCSP3 that allows us to represent constraint satisfaction/optimization problems. The interest of XCSP3-core is multiple: (i)…
PyCSP3: Modeling Combinatorial Constrained Problems in Python
Christophe Lecoutre, Nicolas Szczepanski
In this document, we introduce PyCSP, a Python library that allows us to write models of combinatorial constrained problems in a declarative manner. Currently, with PyCSP, yo…
Proceedings of the 2018 XCSP3 Competition
Christophe Lecoutre, Olivier Roussel
This document represents the proceedings of the 2018 XCSP3 Competition. The results of this competition of constraint solvers were presented at CP'18, the 24th International Confer…
XCSP3: An Integrated Format for Benchmarking Combinatorial Constrained Problems
Frederic Boussemart, Christophe Lecoutre, Gilles Audemard +1
We propose a major revision of the format XCSP 2.1, called XCSP3, to build integrated representations of combinatorial constrained problems. This new format is able to deal with mo…