Systematic Derivation of Bounds and Glue Constraints for Time-Series Constraints

• Published in: Principles and Practice of Constraint Programming Vol. 9892; pp. 13 - 29
• Main Authors: Arafailova, Ekaterina, Beldiceanu, Nicolas, Carlsson, Mats, Flener, Pierre, Francisco Rodríguez, María Andreína, Pearson, Justin, Simonis, Helmut
• Format: Book Chapter Conference Proceeding
• Language: English
• Published: Switzerland Springer International Publishing AG 2016; Springer International Publishing
• Series: Lecture Notes in Computer Science
• Subjects: Absolute Difference; Deterministic Finite Automaton; Mathematical theory of computation; Regular Expression; Signature Constraint; Time Series
• ISBN: 9783319449524; 3319449524; 3319449532; 9783319449531
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/978-3-319-44953-1_2

Integer time series are often subject to constraints on the aggregation of the integer features of all occurrences of some pattern within the series. For example, the number of inflexions may be constrained, or the sum of the peak maxima, or the minimum of the peak widths. It is currently unknown how to maintain domain consistency efficiently on such constraints. We propose parametric ways of systematically deriving glue constraints, which are a particular kind of implied constraints, as well as aggregation bounds that can be added to the decomposition of time-series constraints [5]. We evaluate the beneficial propagation impact of the derived implied constraints and bounds, both alone and together.