{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:11:48Z","timestamp":1760710308542},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T00:00:00Z","timestamp":1595030400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T00:00:00Z","timestamp":1595030400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10601-020-09308-z","type":"journal-article","created":{"date-parts":[[2020,7,18]],"date-time":"2020-07-18T08:03:21Z","timestamp":1595059401000},"page":"71-120","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Invariants for time-series constraints"],"prefix":"10.1007","volume":"25","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":"Helmut","family":"Simonis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,18]]},"reference":[{"key":"9308_CR1","doi-asserted-by":"crossref","unstructured":"Appa, G., Magos, D., & Mourtos, I. (2004). LP relaxations of multiple all_different predicates. In R\u00e9gin, J-C, & Rueher, M (Eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, First International Conference, CPAIOR 2004, volume 3011 of LNCS, pages 364\u2013369, Springer.","DOI":"10.1007\/978-3-540-24664-0_25"},{"key":"9308_CR2","unstructured":"Arafailova, E. (2018). Functional Description of Sequence Constraints and Synthesis of Combinatorial Objects. PhD Thesis, IMT Atlantique LS2N."},{"key":"9308_CR3","unstructured":"Arafailova, E., Beldiceanu, N., Douence, R., Carlsson, M., Flener, P., Rodr\u00edguez, M. A. F., Pearson, J., & Simonis, H. (2018). Global Constraint Catalog, Volume ii, time-Series Constraints. CoRR, abs\/1609, 08925."},{"key":"9308_CR4","doi-asserted-by":"crossref","unstructured":"Arafailova, E., Beldiceanu, N., & Simonis, H. (2017). Generating linear invariants for a conjunction of automata constraints. In Beck, C (Ed.) Principles and Practice of Constraint Programming - CP 2017, volume 10416 of LNCS, pages 21\u201337. Springer.","DOI":"10.1007\/978-3-319-66158-2_2"},{"issue":"1","key":"9308_CR5","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/s10601-017-9276-z","volume":"23","author":"E Arafailova","year":"2018","unstructured":"Arafailova, E., Beldiceanu, N., & Simonis, H. (2018). Deriving generic bounds for time-series constraints based on regular expressions characteristics. Constraints, 23(1), 44\u201386.","journal-title":"Constraints"},{"key":"9308_CR6","doi-asserted-by":"crossref","unstructured":"Arafailova, E., Beldiceanu, N., Carlsson, M., Flener, P., Rodr\u00edguez, M. A. F., Pearson, J., & Simonis, H. (2016). Systematic derivation of bounds and glue constraints for time-series constraints. In Rueher, M (Ed.) Principles and Practice of Constraint Programming - CP 2016, volume 9892 of LNCS, pages 13\u201329. Springer.","DOI":"10.1007\/978-3-319-44953-1_2"},{"key":"9308_CR7","doi-asserted-by":"crossref","unstructured":"Arafailova, E., Beldiceanu, N., Douence, R., Flener, P., Rodr\u00edguez, M A. F., Pearson, J, & Simonis, H. (2016). Time-Series Constraints: Improvements and Application in CP and MIP Contexts. In Quimper, C-G (Ed.) Integration of AI and OR Techniques in Constraint Programming - CPAIOR 2016, volume 9676 of LNCS, pages 18\u201334. Springer.","DOI":"10.1007\/978-3-319-33954-2_2"},{"issue":"4","key":"9308_CR8","doi-asserted-by":"publisher","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":"9308_CR9","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/s10601-015-9200-3","volume":"21","author":"N Beldiceanu","year":"2015","unstructured":"Beldiceanu, N., Carlsson, M., Douence, R., & Simonis, H. (2015). Using finite transducers for describing and synthesising structural time-series constraints. Constraints, 21(1), 22\u201340. January 2016. Journal fast track of CP 2015: summary on p. 723 of LNCS 9255, Springer.","journal-title":"Constraints"},{"key":"9308_CR10","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 Model Seeker. In Schulte, C (Ed.) Principles and Practice of Constraint Programming - CP 2013, volume 8124 of LNCS, pages 733\u2013748. Springer.","DOI":"10.1007\/978-3-642-40627-0_54"},{"key":"9308_CR11","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.-X., & Truchet, C. (2005). Graph invariants as necessary conditions for global constraints. In Beek, P V (Ed.) Principles and Practice of Constraint Programming - CP 2005, volume 3709 of LNCS, pages 92\u2013106. Springer.","DOI":"10.1007\/11564751_10"},{"issue":"12","key":"9308_CR12","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., & Contejean, E. (1994). Introducing global constraints in CHIP. Mathl Comput Modelling, 20(12), 97\u2013123.","journal-title":"Mathl Comput Modelling"},{"key":"9308_CR13","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Flener, P., Pearson, J., & Hentenryck, P. V. (2014). Propagating regular counting constraints. In Brodley, C E , & Stone, P (Eds.) AAAI 2014, pages 2616\u20132622. AAAI Press.","DOI":"10.1609\/aaai.v28i1.9114"},{"key":"9308_CR14","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Mats, C., & Petit, T. (2004). Deriving filtering algorithms from constraint checkers. In Wallace, M (Ed.) Principles and Practice of Constraint Programming - CP 2004, volume 3258 of LNCS, pages 107\u2013122. Springer.","DOI":"10.1007\/978-3-540-30201-8_11"},{"key":"9308_CR15","doi-asserted-by":"crossref","unstructured":"Boutilier, C., Patrascu, R., Poupart, P., & Schuurmans, D. (2003). Constraint-based optimization with the minimax decision criterion. In Rossi, F (Ed.) Principles and Practice of Constraint Programming - CP 2003, volume 2833 of LNCS, pages 168\u2013182. Springer.","DOI":"10.1007\/978-3-540-45193-8_12"},{"key":"9308_CR16","doi-asserted-by":"crossref","unstructured":"Boyd, S. P., & Vandenberghe, L. (2004). Convex optimization. Cambridge University Press.","DOI":"10.1017\/CBO9780511804441"},{"key":"9308_CR17","unstructured":"Bshouty, N. H., Drachsler-Cohen, D., Vechev, M.T., & Yahav, E. (2017). Learning disjunctions of predicates. In Satyen K, & Ohad S (Eds.) Proceedings of the 30th Conference on Learning Theory, COLT 2017, Amsterdam, The Netherlands, 7\u201310 July 2017, (Vol. 65 pp. 346\u2013369)."},{"issue":"2","key":"9308_CR18","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1137\/S0097539794274246","volume":"28","author":"NH Bshouty","year":"1999","unstructured":"Bshouty, N. H., Goldberg, P. W., Goldman, S. A., & Mathias, H. D. (1999). Exact learning of discretized geometric concepts. SIAM J Comput, 28(2), 674\u2013699.","journal-title":"SIAM J Comput"},{"key":"9308_CR19","unstructured":"Charnley, J., Colton, S., & Miguel, I. (2006). Automatic generation of implied constraints. In ECAI 2006, volume 141 of Frontiers in AI and Applications, pages 73\u201377. IOS Press."},{"issue":"1","key":"9308_CR20","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1006\/jcss.1999.1621","volume":"59","author":"Z Chen","year":"1999","unstructured":"Chen, Z., & Ameur, F. (1999). The learnability of unions of two rectangles in the two-dimensional discretized space. Journal of Computer and System Sciences, 59(1), 70\u201383.","journal-title":"Journal of Computer and System Sciences"},{"key":"9308_CR21","unstructured":"COSYTEC, CHIP Reference Manual Release 5.1 edition, 1997."},{"key":"9308_CR22","doi-asserted-by":"crossref","unstructured":"Crochemore, M., Hancart, C., & Lecroq, T. (2007). Algorithms on strings. Cambridge University Press.","DOI":"10.1017\/CBO9780511546853"},{"key":"9308_CR23","unstructured":"Dincbas, M., Simonis, H., & Hentenryck, P. V. (1988). Solving the car-sequencing problem in constraint logic programming. In ECAI (pp. 290\u2013295)."},{"key":"9308_CR24","unstructured":"Rodr\u00edguez, M. A. F., Flener, P., & Pearson, J. (2015). Implied constraints for Automaton constraints. In Gottlob, G, Sutcliffe, G, & Voronkov, A (Eds.) Global Conference on Artificial Intelligence, GCAI 2015, volume 36 of EPiC Series in Computing, pages 113\u2013126. EasyChair."},{"key":"9308_CR25","unstructured":"Rodr\u00edguez, M. A. F., Flener, P., & Pearson, J. (2017). Automatic generation of descriptions of time-series constraints. In Brodsky, A (Ed.) 29th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2017, pages 102\u2013109. IEEE Computer Society."},{"key":"9308_CR26","unstructured":"Decision theory: An Introduction to the Mathematics of Rationality. (1986) French, S (Ed.), Halsted Press, New York."},{"key":"9308_CR27","unstructured":"Frisch, A., Miguel, I., & Walsh, T. (2001). Extensions to proof planning for generating implied constraints. In 9th Symp. on the Integration of Symbolic Computation and Mechanized Reasoning."},{"issue":"4","key":"9308_CR28","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"RL Graham","year":"1972","unstructured":"Graham, R. L. (1972). An efficient algorithm for determining the convex hull of a finite planar set. Information Processing Letters, 1(4), 132\u2013133.","journal-title":"Information Processing Letters"},{"key":"9308_CR29","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/S1571-0653(05)80151-9","volume":"5","author":"P Hansen","year":"2000","unstructured":"Hansen, P., & Caporossi, G. (2000). Autographix: an automated system for finding conjectures in graph theory. Electronic Notes in Discrete Mathematics, 5, 158\u2013161.","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"9308_CR30","unstructured":"Hooker, J.N. (2011). Integrated Methods for Optimization, 2nd edn., Springer Publishing Company Incorporated, Berlin."},{"issue":"3","key":"9308_CR31","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/A:1014804110661","volume":"6","author":"J Lee","year":"2002","unstructured":"Lee, J. (2002). All-different polytopes. J Comb Optim, 6(3), 335\u2013352.","journal-title":"J Comb Optim"},{"key":"9308_CR32","unstructured":"Menana, J. (Oct 2011). Automata and constraint programming for personnel scheduling problems. PhD Thesis, Universite de Nantes\u0301."},{"key":"9308_CR33","doi-asserted-by":"crossref","unstructured":"Menana, J., & Demassey, S. (2009). Sequencing and counting with the multicost-regular constraint. In Hoeve, W. J. V., & Hooker, J. N. (Eds.) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 6th International Conference, CPAIOR 2009, volume 5547 of LNCS, pages 178\u2013192, Springer.","DOI":"10.1007\/978-3-642-01929-6_14"},{"key":"9308_CR34","doi-asserted-by":"crossref","unstructured":"Pesant, G. (2001). A filtering algorithm for the stretch constraint. In Walsh, T (Ed.) Principles and Practice of Constraint Programming - CP 2001, 7th International Conference, CP 2001, volume 2239 of LNCS, pages 183\u2013195. Springer.","DOI":"10.1007\/3-540-45578-7_13"},{"issue":"253","key":"9308_CR35","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1080\/01621459.1951.10500768","volume":"46","author":"Leonard J S","year":"1951","unstructured":"Leonard J. S. (1951). The theory of statistical decision. Journal of the American Statistical Association, 46(253), 55\u201367.","journal-title":"Journal of the American Statistical Association"},{"key":"9308_CR36","doi-asserted-by":"crossref","unstructured":"Veanes, M., Hooimeijer, P., Livshits, B., Molnar, D., & Bj\u00f8rner, N. D. (2012). Symbolic finite state transducers: algorithms and applications. In Field, J, & Hicks, M (Eds.) Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2012, pages 137\u2013150. ACM.","DOI":"10.1145\/2103621.2103674"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-020-09308-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-020-09308-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-020-09308-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T06:13:05Z","timestamp":1667455985000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-020-09308-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,18]]},"references-count":36,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["9308"],"URL":"https:\/\/doi.org\/10.1007\/s10601-020-09308-z","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,7,18]]},"assertion":[{"value":"18 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}