You are here

among Implied Constraints for Two Families of Time-Series Constraints

Authors: 

Ekaterina Arafailova, Nicolas Beldiceanu, Helmut Simonis

Publication Type: 
Refereed Conference Meeting Proceeding
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.
Conference Name: 
CP 2017
Proceedings: 
CP 2017, International Conference on Principles and Practice of Constraint Programming
Digital Object Identifer (DOI): 
10.1007/978-3-319-66158-2_3
Publication Date: 
29/08/2017
Volume: 
LNCS 10416
Pages: 
21-37
Conference Location: 
Australia
Institution: 
National University of Ireland, Cork (UCC)
Project Acknowledges: 
Open access repository: 
No
Publication document: