{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:35:59Z","timestamp":1725492959620},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540749691"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74970-7_17","type":"book-chapter","created":{"date-parts":[[2007,10,9]],"date-time":"2007-10-09T23:49:08Z","timestamp":1191973748000},"page":"210-224","source":"Crossref","is-referenced-by-count":23,"title":["Encodings of the Sequence Constraint"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Brand","sequence":"first","affiliation":[]},{"given":"Nina","family":"Narodytska","sequence":"additional","affiliation":[]},{"given":"Claude-Guy","family":"Quimper","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Stuckey","sequence":"additional","affiliation":[]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"17_CR2","doi-asserted-by":"crossref","unstructured":"Quimper, C.G., Walsh, T.: Global grammar constraints. [11], pp. 751\u2013755","DOI":"10.1007\/11889205_64"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"12","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Mathematical and Computer Modelling\u00a012, 97\u2013123 (1994)","journal-title":"Mathematical and Computer Modelling"},{"key":"17_CR4","first-page":"412","volume-title":"15th Int. Joint Conf. on Artificial Intelligence (IJCAI 1997)","author":"R. Debruyne","year":"1997","unstructured":"Debruyne, R., Bessi\u00e8re, C.: Some practicable filtering techniques for the constraint satisfaction problem. In: 15th Int. Joint Conf. on Artificial Intelligence (IJCAI 1997), pp. 412\u2013417. Morgan Kaufmann, San Francisco (1997)"},{"key":"17_CR5","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: The SLIDE-meta constraint. Technical report (2007)"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"van Hoeve, W.J., Pesant, G., Rousseau, L.M., Sabharwal, A.: Revisiting the Sequence constraint. [11], pp. 620\u2013634","DOI":"10.1007\/11889205_44"},{"key":"17_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BFb0017428","volume-title":"Principles and Practice of Constraint Programming - CP 1997","author":"J.C. R\u00e9gin","year":"1997","unstructured":"R\u00e9gin, J.C., Puget, J.F.: A filtering algorithm for global sequencing constraints. In: Smolka, G. (ed.) Principles and Practice of Constraint Programming - CP 1997. LNCS, vol.\u00a01330, pp. 32\u201346. Springer, Heidelberg (1997)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-45635-X_12","volume-title":"Logic Programming","author":"N. Beldiceanu","year":"2001","unstructured":"Beldiceanu, N., Carlsson, M.: Revisiting the cardinality operator and introducing the cardinality-path constraint family. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 59\u201373. Springer, Heidelberg (2001)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1007\/11493853_22","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J.C. R\u00e9gin","year":"2005","unstructured":"R\u00e9gin, J.C.: Combination of Among and Cardinality constraints. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 288\u2013303. Springer, Heidelberg (2005)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/11814948_19","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"S. Cotton","year":"2006","unstructured":"Cotton, S., Maler, O.: Fast and flexible difference constraint propagation for DPLL(T). In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 170\u2013183. Springer, Heidelberg (2006)"},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming - CP 2006","year":"2006","unstructured":"Benhamou, F. (ed.): CP 2006. LNCS, vol.\u00a04204. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74970-7_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:49:13Z","timestamp":1619520553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74970-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540749691"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74970-7_17","relation":{},"subject":[]}}