Deriving generic bounds for time-series constraints based on regular expressions characteristics
From MaRDI portal
Publication:1706597
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.
Recommendations
- Using finite transducers for describing and synthesising structural time-series constraints
- Invariants for time-series constraints
- Time-series constraints: improvements and application in CP and MIP contexts
- scientific article; zbMATH DE number 2040946
- Regular Expressions with Numerical Constraints and Automata with Counters
Cites work
- scientific article; zbMATH DE number 1517989 (Why is no real title available?)
- A \texttt{cost-regular} based hybrid column generation approach
- Algorithms on Strings
- Approximate comparison of functions computed by distance automata
- On the definition of a family of automata
- Principles and Practice of Constraint Programming – CP 2004
- Principles and Practice of Constraint Programming – CP 2004
- Regular Programming for Quantitative Properties of Data Streams
- Regular functions and cost register automata (invited paper)
- Time-series constraints: improvements and application in CP and MIP contexts
- Using finite transducers for describing and synthesising structural time-series constraints
Cited in
(2)
This page was built for publication: Deriving generic bounds for time-series constraints based on regular expressions characteristics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1706597)