{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T13:23:35Z","timestamp":1762521815536},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,8,16]],"date-time":"2015-08-16T00:00:00Z","timestamp":1439683200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"EU","award":["H2020 FETPROACT-2014 project GRACeFUL"],"award-info":[{"award-number":["H2020 FETPROACT-2014 project GRACeFUL"]}]},{"name":"EDF","award":["Gaspard Monge"],"award-info":[{"award-number":["Gaspard Monge"]}]},{"name":"EU","award":["EU FET grant ICON project number 284715"],"award-info":[{"award-number":["EU FET grant ICON project number 284715"]}]},{"name":"Region Pays de la Loire","award":["Visiting chair"],"award-info":[{"award-number":["Visiting chair"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10601-015-9200-3","type":"journal-article","created":{"date-parts":[[2015,8,15]],"date-time":"2015-08-15T06:04:43Z","timestamp":1439618683000},"page":"22-40","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Using finite transducers for describing and synthesising structural time-series constraints"],"prefix":"10.1007","volume":"21","author":[{"given":"Nicolas","family":"Beldiceanu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mats","family":"Carlsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R\u00e9mi","family":"Douence","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":[[2015,8,16]]},"reference":[{"issue":"4","key":"9200_CR1","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1017\/S1351324997001599","volume":"2","author":"S Abney","year":"1996","unstructured":"Abney, S. (1996). Partial parsing via finite-state cascades. Natural Language Engineering, 2(4), 337\u2013344.","journal-title":"Natural Language Engineering"},{"issue":"4","key":"9200_CR2","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/s10601-005-2809-x","volume":"10","author":"N Beldiceanu","year":"2005","unstructured":"Beldiceanu, N., Carlsson, M., Debruyne, R., & Petit, T. (2005). Reformulation of global constraints based on constraints checkers. Constraints, 10(4), 339\u2013362.","journal-title":"Constraints"},{"issue":"1","key":"9200_CR3","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10601-006-9010-8","volume":"12","author":"N Beldiceanu","year":"2007","unstructured":"Beldiceanu, N., Carlsson, M., Demassey, S., & Petit, T. (2007). Global constraint catalogue: Past, present and future. Constraints, 12(1), 21\u201362.","journal-title":"Constraints"},{"issue":"1","key":"9200_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10601-012-9132-0","volume":"18","author":"N Beldiceanu","year":"2013","unstructured":"Beldiceanu, N., Carlsson, M., Flener, P., & Pearson, J. (2013). On the reification of global constraints. Constraints, 18(1), 1\u20136.","journal-title":"Constraints"},{"key":"9200_CR5","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M., Flener, P., Rodr\u00edguez, M.A.F., & Pearson, J. (2014). Linking prefixes and suffixes for constraints encoded using automata with accumulators. In B. O\u2019Sullivan (Ed.), Principles and practice of constraint programming (CP 2014), LNCS, (Vol. 8656 pp. 142\u2013157): Springer.","DOI":"10.1007\/978-3-319-10428-7_13"},{"key":"9200_CR6","unstructured":"Beldiceanu, N., Carlsson, M., & Rampon, J.X. Global constraint catalog, 2nd edition (revision a). Tech. Rep. T2012-03, Swedish Institute of Computer Science (2012), current version available at, http:\/\/sofdem.github.io\/gccat\/ ."},{"issue":"2","key":"9200_CR7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10601-013-9152-4","volume":"19","author":"N Beldiceanu","year":"2014","unstructured":"Beldiceanu, N., Flener, P., Monette, J.N., Pearson, J., & Simonis, H. (2014). Toward sustainable development in constraint programming. Constraints, 19 (2), 139\u2013149.","journal-title":"Constraints"},{"key":"9200_CR8","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 C. Schulte (Ed.), Principles and practice of constraint programming (CP 2013), LNCS, (Vol. 8124 pp. 733\u2013748): Springer.","DOI":"10.1007\/978-3-642-40627-0_54"},{"key":"9200_CR9","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., & Simonis, H. (2011). A constraint seeker: Finding and ranking global constraints from examples. In J. Lee (Ed.), Principles and Practice of Constraint Programming (CP 2011), LNCS, (Vol. 6876 pp. 12\u201326): Springer.","DOI":"10.1007\/978-3-642-23786-7_4"},{"key":"9200_CR10","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., & Simonis, H. (2012). A model seeker: Extracting global constraint models from positive examples. In M. Milano (Ed.), Principles and Practice of Constraint Programming - 18th International Conference, CP 2012, Quebec City, QC, Canada, October 8-12, 2012. Proceedings. Lecture Notes in Computer Science, (Vol. 7514 pp. 141\u2013157): Springer. doi: 10.1007\/978-3-642-33558-7_13 .","DOI":"10.1007\/978-3-642-33558-7_13"},{"key":"9200_CR11","doi-asserted-by":"crossref","unstructured":"Berstel, J. (1979). Transductions and context-free languages: Teubner.","DOI":"10.1007\/978-3-663-09367-1"},{"key":"9200_CR12","unstructured":"Carlsson, M., & et al. SICStus Prolog User\u2019s Manual. Swedish Institute of Computer Science, 4.3.1 edn. (November 2014), current version available at, https:\/\/sicstus.sics.se\/sicstus\/docs\/latest4\/pdf\/sicstus.pdf ."},{"issue":"1","key":"9200_CR13","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/j.engappai.2010.09.007","volume":"24","author":"T Fu","year":"2011","unstructured":"Fu, T. (2011). A review on time series data mining. Engineering Applications of Artificial Intelligence, 24(1), 164\u2013181. http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0952197610001727 .","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"9200_CR14","volume-title":"Methods for the estimation of missing values in time series. Master\u2019s thesis","author":"DSC Fung","year":"2006","unstructured":"Fung, D.S.C. (2006). Methods for the estimation of missing values in time series. Master\u2019s thesis. Perth: Edith Cowan University."},{"key":"9200_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2014.03.001","volume":"211","author":"IP Gent","year":"2014","unstructured":"Gent, I.P., Jefferson, C., Linton, S., Miguel, I., & Nightingale, P. (2014). Generating custom propagators for arbitrary constraints. Artificial Intelligence, 211, 1\u201333.","journal-title":"Artificial Intelligence"},{"key":"9200_CR16","doi-asserted-by":"crossref","unstructured":"Goldin, D.Q., & Kanellakis, P.C. (1995). On similarity queries for time-series data: Constraint specification and implementation. In U. Montanari, & F. Rossi (Eds.), Principles and Practice of Constraint Programming (CP 1995), LNCS, (Vol. 976 pp. 137\u2013153): Springer.","DOI":"10.1007\/3-540-60299-2_9"},{"issue":"12\u201313","key":"9200_CR17","doi-asserted-by":"crossref","first-page":"1951","DOI":"10.1016\/j.artint.2011.05.002","volume":"175","author":"T Guns","year":"2011","unstructured":"Guns, T., Nijssen, S., & De Raedt, L. (2011). Itemset mining: A constraint programming perspective. Artificial Intelligence, 175(12\u201313), 1951\u20131983.","journal-title":"Artificial Intelligence"},{"key":"9200_CR18","doi-asserted-by":"crossref","unstructured":"Harvey, A. (1991). Forecasting, structural time series models and the Kalman filter: Cambridge University Press.","DOI":"10.1017\/CBO9781107049994"},{"key":"9200_CR19","unstructured":"Lauri\u00e8re, J.L. Constraint propagation or automatic programming. Tech. Rep. 19, IBP-Laforia (1996), in French, available at, https:\/\/www.lri.fr\/sebag\/Slides\/Lauriere\/Rabbit.pdf ."},{"issue":"11","key":"9200_CR20","doi-asserted-by":"crossref","first-page":"1857","DOI":"10.1016\/j.patcog.2005.01.025","volume":"38","author":"TW Liao","year":"2005","unstructured":"Liao, T.W. (2005). Clustering of time series data - a survey. Pattern Recognition, 38(11), 1857\u20131874. doi: 10.1016\/j.patcog.2005.01.025 .","journal-title":"Pattern Recognition"},{"key":"9200_CR21","unstructured":"Nhon, D.T., & Wilkinson, L. (2013). TimeExplorer: Similarity search time series by their signatures. In G. Bebis, R. Boyle, B. Parvin, D. Koracin, B. Li, F. Porikli, V.B. Zordan, J.T. Klosowski, S. Coquillart, X. Luo, M. Chen, & D. Gotz (Eds.), 9th International Symposium on Advances in Visual Computing (ISVC 2013), LNCS, (Vol. 8033 pp. 280\u2013289): Springer."},{"key":"9200_CR22","doi-asserted-by":"crossref","unstructured":"Perng, C.S., Wang, H., Zhang, S.R., & Parker, D.S. (2000). Landmarks: A new model for similarity-based pattern querying in time series databases. In 16th International Conference on Data Engineering (ICDE 2000) (pp. 33\u201342): IEEE.","DOI":"10.1109\/ICDE.2000.839385"},{"key":"9200_CR23","first-page":"1049","volume-title":"Data mining and knowledge discovery handbook","author":"C Ratanamahatana","year":"2010","unstructured":"Ratanamahatana, C., Lin, J., Gunopulos, D., Keogh, E., Vlachos, M., & Das, G. (2010). Mining time series data. In O. Maimon, & L. Rokach (Eds.), Data mining and knowledge discovery handbook (pp. 1049\u20131077). US: Springer. doi: 10.1007\/978-0-387-09823-4_56 ."},{"key":"9200_CR24","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J. (2009). Elements of language theory: Cambridge University Press.","DOI":"10.1017\/CBO9781139195218"},{"key":"9200_CR25","unstructured":"Smith, D.R., & Westfold, S.J. Toward the synthesis of constraint solvers. Tech. Rep. TR-1311, Kestrel Institute (2013), available at, http:\/\/www.kestrel.edu\/home\/people\/smith\/pub\/CW-report.pdf ."},{"key":"9200_CR26","doi-asserted-by":"crossref","unstructured":"Veanes, M., Hooimeijer, P., Livshits, B., Molnar, D., & Bj\u00f8rner, N. (2012). Symbolic finite state transducers: algorithms and applications. In J. Field, & M. Hicks (Eds.), Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, Philadelphia, Pennsylvania, USA (pp. 137\u2013150): ACM.","DOI":"10.1145\/2103656.2103674"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9200-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-015-9200-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9200-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T18:18:02Z","timestamp":1589566682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-015-9200-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,16]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9200"],"URL":"https:\/\/doi.org\/10.1007\/s10601-015-9200-3","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,16]]}}}