AMONG Implied Constraints for Two Families of Time-Series Constraints - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2017

AMONG Implied Constraints for Two Families of Time-Series Constraints

Abstract

We consider, for an integer time series, two families of constraints restricting the max, and the sum, respectively, of the surfaces of the elements of the sub-series corresponding to occurrences of some pattern. In recent work these families were identified as the most difficult to solve compared to all other time-series constraints. For all patterns of the time-series constraints catalogue, we provide a unique per family parameterised among implied constraint that can be imposed on any prefix/suffix of a time-series. Experiments show that it reduces both the number of backtracks/time spent by up to 4/3 orders of magnitude.
Fichier principal
Vignette du fichier
paper.pdf (750.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01651585 , version 1 (29-11-2017)

Identifiers

Cite

Ekaterina Arafailova, Nicolas Beldiceanu, Helmut Simonis. AMONG Implied Constraints for Two Families of Time-Series Constraints. CP 2017 : 23rd International Conference on Principles and Practice of Constraint Programming, Aug 2017, Melbourne, Australia. ⟨10.1007/978-3-319-66158-2_3⟩. ⟨hal-01651585⟩
116 View
120 Download

Altmetric

Share

Gmail Facebook X LinkedIn More