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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download
Contributor : Ekaterina Arafailova <>
Submitted on : Wednesday, November 29, 2017 - 10:57:56 AM
Last modification on : Tuesday, March 26, 2019 - 9:25:22 AM


Files produced by the author(s)


  • HAL Id : hal-01651585, version 1


Ekaterina Arafailova, Nicolas Beldiceanu, Helmut Simonis. AMONG Implied Constraints for Two Families of Time-Series Constraints. The 23rd International Conference on Principles and Practice of Constraint Programming, Aug 2017, Melbourne, Australia. ⟨hal-01651585⟩



Record views


Files downloads