{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:52:07Z","timestamp":1760709127981,"version":"3.41.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319449524"},{"type":"electronic","value":"9783319449531"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_2","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T15:12:23Z","timestamp":1471878743000},"page":"13-29","source":"Crossref","is-referenced-by-count":7,"title":["Systematic Derivation of Bounds and Glue Constraints for Time-Series Constraints"],"prefix":"10.1007","author":[{"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":"Mats","family":"Carlsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Flener","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00eda Andre\u00edna","family":"Francisco Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Pearson","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":[[2016,8,23]]},"reference":[{"issue":"2","key":"2_CR1","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/j.tcs.2007.07.029","volume":"387","author":"M Almeida","year":"2007","unstructured":"Almeida, M., Moreira, N., Reis, R.: Enumeration and generation with a string automata representation. Theor. Comput. Sci. 387(2), 93\u2013102 (2007). The FAdo tool is available at http:\/\/fado.dcc.fc.up.pt\/","journal-title":"Theor. Comput. Sci."},{"key":"2_CR2","unstructured":"Arafailova, E., Beldiceanu, N., Carlsson, M., Douence, R., Flener, P., Francisco\u00a0Rodr\u00edguez, M.A., Pearson, J., Simonis, H.: Global constraint catalog, volume ii: time-series constraints. Technical report, Computing Research Repository (forthcoming). http:\/\/arxiv.org"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-319-33954-2_2","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"E Arafailova","year":"2016","unstructured":"Arafailova, E., Beldiceanu, N., Douence, R., Flener, P., Francisco Rodr\u00edguez, M.A., Pearson, J., Simonis, H.: Time-series constraints: improvements and application in CP and MIP contexts. In: Quimper, C.-G., Cavallo, M. (eds.) CPAIOR 2016. LNCS, vol. 9676, pp. 18\u201334. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-33954-2_2"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/3-540-45578-7_26","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"N Beldiceanu","year":"2001","unstructured":"Beldiceanu, N., Carlsson, M.: Sweep as a generic pruning technique applied to the non-overlapping rectangles constraint. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 377\u2013391. Springer, Heidelberg (2001)"},{"issue":"1","key":"2_CR5","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.: Using finite transducers for describing and synthesising structural time-series constraints. Constraints 21(1), 22\u201340 (2016). Journal fast track of CP 2015: summary on p. 723 of LNCS 9255, Springer (2015)","journal-title":"Constraints"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/978-3-319-10428-7_13","volume-title":"Principles and Practice of Constraint Programming","author":"N Beldiceanu","year":"2014","unstructured":"Beldiceanu, N., Carlsson, M., Flener, P., Rodr\u00edguez, M.A.F., Pearson, J.: Linking prefixes and suffixes for constraints encoded using automata with accumulators. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 142\u2013157. Springer, Heidelberg (2014)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/978-3-540-30201-8_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"N Beldiceanu","year":"2004","unstructured":"Beldiceanu, N., Carlsson, M., Petit, T.: Deriving filtering algorithms from constraint checkers. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 107\u2013122. Springer, Heidelberg (2004)"},{"key":"2_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1007\/978-3-642-40627-0_54","volume-title":"Principles and Practice of Constraint Programming","author":"N Beldiceanu","year":"2013","unstructured":"Beldiceanu, N., Ifrim, G., Lenoir, A., Simonis, H.: 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. Springer, Heidelberg (2013)"},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1007\/978-3-540-73580-9_9","volume-title":"Abstraction, Reformulation, and Approximation","author":"C Bessi\u00e9re","year":"2007","unstructured":"Bessi\u00e9re, C., Hebrard, E., Hnich, B., Kiziltan, Z., Quimper, C.-G., Walsh, T.: Reformulating global constraints: the Slide and Regular constraints. In: Miguel, I., Ruml, W. (eds.) SARA 2007. LNCS (LNAI), vol. 4612, pp. 80\u201392. Springer, Heidelberg (2007)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/978-3-642-15396-9_12","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"C Bessi\u00e9re","year":"2010","unstructured":"Bessi\u00e9re, C., Katsirelos, G., Narodytska, N., Quimper, C.-G., Walsh, T.: Decomposition of the NValue constraint. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 114\u2013128. Springer, Heidelberg (2010)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Francisco Rodr\u00edguez, M.A., Flener, P., Pearson, J.: Implied constraints for Automaton constraints. In: Gottlob, G., Sutcliffe, G., Voronkov, A. (eds.) GCAI 2015. EasyChair Proceedings in Computing, vol. 36, pp. 113\u2013126 (2015)","DOI":"10.29007\/m767"},{"key":"2_CR12","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"JE Hopcroft","year":"2007","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 3rd edn. Addison-Wesley, Boston (2007)","edition":"3"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1007\/978-3-642-33558-7_40","volume-title":"Principles and Practice of Constraint Programming","author":"J-N Monette","year":"2012","unstructured":"Monette, J.-N., Flener, P., Pearson, J.: Towards solver-independent propagators. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 544\u2013560. Springer, Heidelberg (2012)"},{"key":"2_CR14","unstructured":"R\u00e9gin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Hayes-Roth, B., Korf, R.E. (eds.) AAAI 1994, pp. 362\u2013367. AAAI Press (1994)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Van\u00a0Hentenryck, P., Saraswat, V., Deville, Y.: Design, implementation, and evaluation of the constraint language cc (FD). Technical report CS-93-02, Brown University, Providence, USA, January 1993. Revised version in Journal of Logic Programming 37(1\u20133), 293\u2013316 (1998). Based on the unpublished manuscript Constraint Processing in cc (FD) (1991)","DOI":"10.1016\/S0743-1066(98)10006-7"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44953-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T11:50:03Z","timestamp":1749556203000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}