@inproceedings{bc628c3080364af2936a8465bc414b9c,
title = "Generating linear invariants for a conjunction of automata constraints",
abstract = "We propose a systematic approach for generating linear implied constraints that link the values returned by several automata with accumulators after consuming the same input sequence. The method handles automata whose accumulators are increased by (or reset to) some non-negative integer value on each transition. We evaluate the impact of the generated linear invariants on conjunctions of two families of time-series constraints.",
author = "Ekaterina Arafailova and Nicolas Beldiceanu and Helmut Simonis",
note = "Publisher Copyright: {\textcopyright} Springer International Publishing AG 2017.; 23rd International Conference on the Principles and Practice of Constraint Programming, CP 2017 ; Conference date: 28-08-2017 Through 01-09-2017",
year = "2017",
doi = "10.1007/978-3-319-66158-2\_2",
language = "English",
isbn = "9783319661575",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "21--37",
editor = "J.Christopher Beck",
booktitle = "Principles and Practice of Constraint Programming - 23rd International Conference CP 2017, Proceedings",
address = "Germany",
}