Deriving generic bounds for time-series constraints based on regular expressions characteristics

DOI10.1007/S10601-017-9276-ZzbMATH Open1396.90047arXiv1703.06783OpenAlexW2604433850MaRDI QIDQ1706597FDOQ1706597

Authors: Ekaterina Arafailova, Nicolas Beldiceanu, Helmut Simonis 

Publication date: 22 March 2018

Published in: Constraints (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1703.06783

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

zbMATH Keywords

global constraintssharp boundstime-series constraintsquantitative regular expressionsregular programming

Mathematics Subject Classification ID

Integer programming (90C10)

Cites Work

• Using finite transducers for describing and synthesising structural time-series constraints
• Title not available (Why is that?)
• Principles and Practice of Constraint Programming – CP 2004
• A \texttt{cost-regular} based hybrid column generation approach
• On the definition of a family of automata
• Approximate comparison of functions computed by distance automata
• Algorithms on Strings
• Time-series constraints: improvements and application in CP and MIP contexts
• Principles and Practice of Constraint Programming – CP 2004
• Regular functions and cost register automata (invited paper)
• Regular Programming for Quantitative Properties of Data Streams

Cited In (2)

• Invariants for time-series constraints
• Using finite transducers for describing and synthesising structural time-series constraints

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)