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 • 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 • 15 Jan 2019 • Ekaterina Arafailova, Nicolas Beldiceanu, Helmut Simonis
Many constraints restricting the result of some computations over an integer sequence can be compactly represented by register automata.
no code implementations • 26 Sep 2016 • Ekaterina Arafailova, Nicolas Beldiceanu, Rémi Douence, Mats Carlsson, Pierre Flener, María Andreína Francisco Rodríguez, Justin Pearson, Helmut Simonis
First this report presents a restricted set of finite transducers used to synthesise structural time-series constraints described by means of a multi-layered function composition scheme.
no code implementations • 27 Sep 2013 • Nicolas Beldiceanu, Pierre Flener, Justin Pearson, Pascal Van Hentenryck
Constraints over finite sequences of variables are ubiquitous in sequencing and timetabling.