no code implementations • 14 Dec 2023 • Jovial Cheukam-Ngouonou, Ramiz Gindullin, Nicolas Beldiceanu, Rémi Douence, Claude-Guy Quimper
We present the proofs of the conjectures mentioned in the paper published in the proceedings of the 2024 AAAI conference [1], and discovered by the decomposition methods presented in the same paper.
no code implementations • 14 Mar 2020 • Christian Bessiere, Clement Carbonnel, Anton Dries, Emmanuel Hebrard, George Katsirelos, Nadjib Lazaar, Nina Narodytska, Claude-Guy Quimper, Kostas Stergiou, Dimosthenis C. Tsouros, Toby Walsh
Learning constraint networks is known to require a number of membership queries exponential in the number of variables.
no code implementations • 3 Dec 2019 • Nicolas Beldiceanu, Mats Carlsson, Claude-Guy Quimper, Maria-Isabel Restrepo-Ruiz
Given, a sequence $\mathcal{X}$ of $n$ variables, a time-series constraint ctr using the Sum aggregator, and a sliding time-series constraint enforcing the constraint ctr on each sliding window of $\mathcal{X}$ of $m$ consecutive variables, we describe a $\Theta(n)$ time complexity checker, as well as a $\Theta(n)$ space complexity reformulation for such sliding constraint.
no code implementations • 18 Jan 2014 • Gilles Pesant, Claude-Guy Quimper, Alessandro Zanarini
Designing a search heuristic for constraint programming that is reliable across problem domains has been an important research topic in recent years.