Deriving Generic Bounds for Time-Series Constraints Based on Regular Expressions Characteristics
Ekaterina Arafailova, Nicolas Beldiceanu, Helmut Simonis

TL;DR
This paper introduces regular expression characteristics to derive generic bounds for time-series constraints, enabling a unified and compositional approach to defining and managing these bounds without ad-hoc methods.
Contribution
It presents a novel concept of regular expression characteristics that unify and simplify the derivation of bounds for time-series constraints.
Findings
Provides a unified framework for time-series constraint bounds
Enables compositional handling of constraints
Eliminates need for ad-hoc bounds for individual constraints
Abstract
We introduce the concept of regular expression characteristics as a unified way to concisely express bounds on time-series constraints. This allows us not only to define time-series constraints in a compositional way, but also to deal with their combinatorial aspect in a compositional way, without developing ad-hoc bounds for each time-series constraint separately.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsConstraint Satisfaction and Optimization · Time Series Analysis and Forecasting · Advanced Database Systems and Queries
