{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:29:43Z","timestamp":1725798583509},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319104270"},{"type":"electronic","value":"9783319104287"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-10428-7_13","type":"book-chapter","created":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T01:33:54Z","timestamp":1407893634000},"page":"142-157","source":"Crossref","is-referenced-by-count":4,"title":["Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators"],"prefix":"10.1007","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":"Pierre","family":"Flener","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar\u00eda Andre\u00edna Francisco","family":"Rodr\u00edguez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Justin","family":"Pearson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"13_CR1","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.: Global constraint catalogue: Past, present, and future. Constraints\u00a012(1), 21\u201362 (2007)","journal-title":"Constraints"},{"issue":"1","key":"13_CR2","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/s10601-012-9134-y","volume":"18","author":"N. Beldiceanu","year":"2013","unstructured":"Beldiceanu, N., Carlsson, M., Flener, P., Pearson, J.: On matrices, automata, and double counting in constraint programming. Constraints\u00a018(1), 108\u2013140 (2013)","journal-title":"Constraints"},{"issue":"1","key":"13_CR3","doi-asserted-by":"publisher","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.: On the reification of global constraints. Constraints\u00a018(1), 1\u20136 (2013)","journal-title":"Constraints"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a03258, pp. 107\u2013122. Springer, Heidelberg (2004)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/11564751_10","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"N. Beldiceanu","year":"2005","unstructured":"Beldiceanu, N., Carlsson, M., Rampon, J.-X., Truchet, C.: Graph invariants as necessary conditions for global constraints. In: van Beek, P. (ed.) CP 2005. LNCS, vol.\u00a03709, pp. 92\u2013106. Springer, Heidelberg (2005)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Beldiceanu, N., Flener, P., Pearson, J., Van\u00a0Hentenryck, P.: Propagating regular counting constraints. In: Brodley, C.E., Stone, P. (eds.) AAAI 2014. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.9114"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a08124, pp. 733\u2013748. Springer, Heidelberg (2013)"},{"key":"13_CR8","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: SLIDE: A useful special case of the CARDPATH constraint. In: Ghallab, M., et al. (eds.) ECAI 2008, pp. 475\u2013479. IOS Press (2008)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BFb0033845","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"M. Carlsson","year":"1997","unstructured":"Carlsson, M., Ottosson, G., Carlson, B.: An open-ended finite domain constraint solver. In: Glaser, H., Hartel, P., Kuchen, H. (eds.) PLILP 1997. LNCS, vol.\u00a01292, pp. 191\u2013206. Springer, Heidelberg (1997), http:\/\/sicstus.sics.se\/"},{"issue":"4","key":"13_CR10","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.: A Cost-Regular based hybrid column generation approach. Constraints\u00a011(4), 315\u2013333 (2006)","journal-title":"Constraints"},{"issue":"2-3","key":"13_CR11","doi-asserted-by":"crossref","first-page":"223","DOI":"10.3233\/FI-2011-401","volume":"107","author":"J. He","year":"2011","unstructured":"He, J., Flener, P., Pearson, J.: An automaton constraint for local search. Fundamenta Informaticae\u00a0107(2-3), 223\u2013248 (2011)","journal-title":"Fundamenta Informaticae"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Mohri, M.: Weighted automata algorithms. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata. Monographs in Theoretical Computer Science, pp. 213\u2013254. Springer (2009)","DOI":"10.1007\/978-3-642-01492-5_6"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Mohri, M., Pereira, F.C.N., Riley, M.: The design principles of a weighted finite-state transducer library. Theoretical Computer Science\u00a0231(1), 17\u201332 (2000), The OpenFst Library is available http:\/\/www.openfst.org\/","DOI":"10.1016\/S0304-3975(99)00014-6"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-30201-8_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"G. Pesant","year":"2004","unstructured":"Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 482\u2013495. Springer, Heidelberg (2004)"},{"key":"13_CR15","unstructured":"Van Hentenryck, P., Michel, L.: Constraint-Based Local Search. MIT Press (2005)"}],"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-10428-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T22:29:45Z","timestamp":1689460185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-10428-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319104270","9783319104287"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-10428-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}