{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T16:27:26Z","timestamp":1777566446672,"version":"3.51.4"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,12,23]],"date-time":"2017-12-23T00:00:00Z","timestamp":1513987200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["640954"],"award-info":[{"award-number":["640954"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Gaspard Monge Program for Optimization and Operations Research (PGMO)"},{"DOI":"10.13039\/501100001602","name":"Science Foundation Ireland","doi-asserted-by":"publisher","award":["SFI\/10\/IN.1\/I3032"],"award-info":[{"award-number":["SFI\/10\/IN.1\/I3032"]}],"id":[{"id":"10.13039\/501100001602","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001602","name":"Science Foundation Ireland","doi-asserted-by":"publisher","award":["SFI\/12\/RC\/2289"],"award-info":[{"award-number":["SFI\/12\/RC\/2289"]}],"id":[{"id":"10.13039\/501100001602","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s10601-017-9276-z","type":"journal-article","created":{"date-parts":[[2017,12,23]],"date-time":"2017-12-23T01:29:37Z","timestamp":1513992577000},"page":"44-86","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Deriving generic bounds for time-series constraints based on regular expressions characteristics"],"prefix":"10.1007","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9447-1142","authenticated-orcid":false,"given":"Ekaterina","family":"Arafailova","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Beldiceanu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helmut","family":"Simonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,12,23]]},"reference":[{"key":"9276_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., D\u2019Antoni, L., Deshmukh, J. V., Raghothaman, M., & Yuan, Y. (2013). Regular functions and cost register automata. In 28th annual ACM\/IEEE symposium on logic in computer science, LICS 2013 (pp. 13\u201322). New Orleans: IEEE Computer Society.","DOI":"10.1109\/LICS.2013.65"},{"key":"9276_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., Fisman, D., & Raghothaman, M. (2016). Regular programming for quantitative properties of data streams. In Thiemann, P (Ed.) Programming languages and systems - 25th European symposium on programming, ESOP 2016, held as part of the European joint conferences on theory and practice of software, ETAPS 2016, Eindhoven, The Netherlands, April 2\u20138, 2016, Proceedings. Lecture notes in computer science (Vol. 9632, pp. 15\u201340). Eindhoven: Springer.","DOI":"10.1007\/978-3-662-49498-1_2"},{"key":"9276_CR3","doi-asserted-by":"crossref","unstructured":"Arafailova, E., Beldiceanu, N., Carlsson, M., Flener, P., Francisco Rodr\u00edguez, M.A., Pearson, J., & Simonis, H. (2016). Systematic derivation of bounds and glue constraints for time-series constraints. In Rueher, M. (Ed.) CP 2016. LNCS (Vol. 9892, pp. 13\u201329). Cham: Springer.","DOI":"10.1007\/978-3-319-44953-1_2"},{"key":"9276_CR4","unstructured":"Arafailova, E., Beldiceanu, N., Douence, R., Carlsson, M., Flener, P., Rodr\u00edguez, M.A.F., Pearson, J., & Simonis, H. (2016). Global constraint catalog, volume ii, time-series constraints. CoRR \n                        1609.08925\n                        \n                    ."},{"key":"9276_CR5","doi-asserted-by":"crossref","unstructured":"Arafailova, E., Beldiceanu, N., Douence, R., Flener, P., Francisco Rodr\u00edguez, M.A., Pearson, J., & Simonis, H. (2016). Time-series constraints: improvements and application in CP and MIP contexts. In Quimper, C.G. (Ed.) CP-AI-OR 2016. LNCS (Vol. 9676, pp. 18\u201334). Cham: Springer.","DOI":"10.1007\/978-3-319-33954-2_2"},{"issue":"1","key":"9276_CR6","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/s10601-015-9200-3","volume":"21","author":"N Beldiceanu","year":"2016","unstructured":"Beldiceanu, N., Carlsson, M., Douence, R., & Simonis, H. (2016). Using finite transducers for describing and synthesising structural time-series constraints. Constraints, 21(1), 22\u201340. Journal fast track of CP 2015: summary on p. 723 of LNCS 9255, Springer, 2015.","journal-title":"Constraints"},{"key":"9276_CR7","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M., Flener, P., Francisco Rodr\u00edguez, M. A., & Pearson, J. (2014). Linking prefixes and suffixes for constraints encoded using automata with accumulators. In O\u2019Sullivan, B (Ed.) CP 2014. LNCS (Vol. 8656, pp. 142\u2013157). Cham: Springer.","DOI":"10.1007\/978-3-319-10428-7_13"},{"key":"9276_CR8","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M., & Petit, T. (2004). Deriving filtering algorithms from constraint checkers. In Wallace, M. (Ed.) CP 2004. LNCS (Vol. 3258, pp. 107\u2013122). Berlin, Heidelberg: Springer.","DOI":"10.1007\/978-3-540-30201-8_11"},{"key":"9276_CR9","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Ifrim, G., Lenoir, A., & Simonis, H. (2013). Describing and generating solutions for the EDF unit commitment problem with the ModelSeeker. In Schulte, C. (Ed.) CP 2013. LNCS (Vol. 8124, pp. 733\u2013748). Berlin, Heidelberg: Springer.","DOI":"10.1007\/978-3-642-40627-0_54"},{"issue":"4","key":"9276_CR10","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/s00224-015-9643-3","volume":"58","author":"T Colcombet","year":"2016","unstructured":"Colcombet, T., & Daviaud, L. (2016). Approximate comparison of functions computed by distance automata. Theory on Computer System, 58(4), 579\u2013613.","journal-title":"Theory on Computer System"},{"key":"9276_CR11","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on strings","author":"M Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., & Lecroq, T. (2007). Algorithms on strings. Cambridge: Cambridge University Press."},{"issue":"4","key":"9276_CR12","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10601-006-9003-7","volume":"11","author":"S Demassey","year":"2006","unstructured":"Demassey, S., Pesant, G., & Rousseau, L. M. (2006). A cost-regular based hybrid column generation approach. Constraints, 11(4), 315\u2013333.","journal-title":"Constraints"},{"key":"9276_CR13","unstructured":"Hopcroft, J. E., Motwani, R., & Ullman, J. D. (2007). Introduction to automata theory, languages, and computation, 3rd Edn. Boston: Addison-Wesley."},{"key":"9276_CR14","doi-asserted-by":"crossref","unstructured":"Ishihara, Y., Moroto, T., Shimizu, S., Hashimoto, K., & Fujiwara, T. (2009). A tractable subclass of dtds for xpath satisfiability with sibling axes. In Philippa, G., & Floris, G. (Eds.) Database programming languages: 12th international symposium, DBPL 2009s. LNCS (Vol. 5708, pp. 68\u201383). Berlin, Heidelberg: Springer.","DOI":"10.1007\/978-3-642-03793-1_5"},{"key":"9276_CR15","doi-asserted-by":"crossref","unstructured":"Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In Wallace, M. (Ed.) CP 2004. LNCS (Vol. 3258, pp. 482\u2013495). Berlin, Heidelberg: Springer.","DOI":"10.1007\/978-3-540-30201-8_36"},{"key":"9276_CR16","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0019-9958(61)80020-X","volume":"4","author":"MP Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M. P. (1961). On the definition of a family of automata. Information and Control, 4, 245\u2013270.","journal-title":"Information and Control"},{"key":"9276_CR17","doi-asserted-by":"publisher","unstructured":"Simonis, H., Davern, P., Feldman, J., Mehta, D., Quesada, L., & Carlsson, M. (2010). A generic visualization platform for CP. In Cohen, D. (Ed.) Principles and practice of constraint programming - CP 2010 - 16th international conference, CP 2010, St. Andrews, Scotland, UK, September 6\u201310, 2010. Proceedings. Lecture notes in computer science (Vol. 6308, pp. 460\u2013474). Berlin, Heidelberg: Springer, DOI \n                        https:\/\/doi.org\/10.1007\/978-3-642-15396-9_37\n                        \n                    .","DOI":"10.1007\/978-3-642-15396-9_37"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-017-9276-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-017-9276-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-017-9276-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T12:17:36Z","timestamp":1526645856000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-017-9276-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,23]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["9276"],"URL":"https:\/\/doi.org\/10.1007\/s10601-017-9276-z","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,23]]}}}