{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:17:46Z","timestamp":1740122266867,"version":"3.37.3"},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T00:00:00Z","timestamp":1653004800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T00:00:00Z","timestamp":1653004800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","award":["2018-04813"],"award-info":[{"award-number":["2018-04813"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2022,7]]},"DOI":"10.1007\/s10601-022-09333-0","type":"journal-article","created":{"date-parts":[[2022,5,20]],"date-time":"2022-05-20T06:06:54Z","timestamp":1653026814000},"page":"161-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["When bounds consistency implies domain consistency for regular counting constraints"],"prefix":"10.1007","volume":"27","author":[{"given":"Barnaby","family":"Martin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0084-8891","authenticated-orcid":false,"given":"Justin","family":"Pearson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,20]]},"reference":[{"key":"9333_CR1","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Carlsson, M., & Petit, T. (2004). Deriving filtering algorithms from constraint checkers. In M. Wallace (Ed.) CP 2004, LNCS, (Vol. 3258 pp. 107\u2013122). Springer.","DOI":"10.1007\/978-3-540-30201-8_11"},{"issue":"4","key":"9333_CR2","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"},{"key":"9333_CR3","doi-asserted-by":"crossref","unstructured":"Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In M. Wallace (Ed.) CP 2004, LNCS, (Vol. 3258 pp. 482\u2013495). Springer.","DOI":"10.1007\/978-3-540-30201-8_36"},{"issue":"4","key":"9333_CR4","doi-asserted-by":"publisher","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":"9333_CR5","doi-asserted-by":"crossref","unstructured":"Menana, J., & Demassey, S. (2009). Sequencing and counting with the multicost-regular constraint. In W.J. van Hoeve J.N. Hooker (Eds.) CP-AI-OR 2009, LNCS, (Vol. 5547 pp. 178\u2013192). Springer.","DOI":"10.1007\/978-3-642-01929-6_14"},{"key":"9333_CR6","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 M. Rueher (Ed.) CP 2016, LNCS, (Vol. 9892 pp. 13\u201329). Springer.","DOI":"10.1007\/978-3-319-44953-1_2"},{"issue":"1","key":"9333_CR7","doi-asserted-by":"publisher","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-title":"Constraints"},{"key":"9333_CR8","unstructured":"Francisco Rodr\u00edguez, M.A. (2017). Analysis, synthesis and application of automaton-based constraint descriptions. Ph.D. thesis, Department of Information Technology, Uppsala University, Sweden, Department of Information Technology, Uppsala University, Sweden.\u00a0http:\/\/urn.kb.se\/resolve?urn=urn%3Anbn%3Ase%3Auu%3Adiva-332149."},{"key":"9333_CR9","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Flener, P., Pearson, J., & Van Hentenryck, P. (2014). Propagating regular counting constraints. In C.E. Brodley P. Stone (Eds.) AAAI 2014 (pp. 2616\u20132622). AAAI Press.","DOI":"10.1609\/aaai.v28i1.9114"},{"issue":"3","key":"9333_CR10","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1145\/1065887.1065889","volume":"27","author":"C Schulte","year":"2005","unstructured":"Schulte, C., & Stuckey, P. J. (2005). When do bounds and domain propagation lead to the same search space? Transactions on Programming Languages and Systems (TOPLAS), 27(3), 388\u2013425.","journal-title":"Transactions on Programming Languages and Systems (TOPLAS)"},{"key":"9333_CR11","doi-asserted-by":"crossref","unstructured":"Scott, J.D. (2016). Other things besides number: Abstraction, constraint propagation, and string variable types. Ph.D. thesis, Department of Information Technology, Uppsala University, Sweden. https:\/\/urn.kb.se\/resolve?urn=urn:nbn:se:uu:diva-273311.","DOI":"10.1007\/s10601-016-9263-9"},{"issue":"1","key":"9333_CR12","doi-asserted-by":"publisher","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. The catalogue and the current working version are available at http:\/\/sofdem.github.io\/gccat.","journal-title":"Constraints"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-022-09333-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-022-09333-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-022-09333-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,8]],"date-time":"2022-08-08T12:18:20Z","timestamp":1659961100000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-022-09333-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,20]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,7]]}},"alternative-id":["9333"],"URL":"https:\/\/doi.org\/10.1007\/s10601-022-09333-0","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2022,5,20]]},"assertion":[{"value":"25 April 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}