{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:30:15Z","timestamp":1725564615753},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153952"},{"type":"electronic","value":"9783642153969"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15396-9_12","type":"book-chapter","created":{"date-parts":[[2010,9,6]],"date-time":"2010-09-06T03:00:16Z","timestamp":1283742016000},"page":"114-128","source":"Crossref","is-referenced-by-count":7,"title":["Decomposition of the NValue Constraint"],"prefix":"10.1007","author":[{"given":"Christian","family":"Bessiere","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Katsirelos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nina","family":"Narodytska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Claude-Guy","family":"Quimper","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","first-page":"362","volume-title":"Proc. of the 12th National Conf. on AI","author":"J.C. R\u00e9gin","year":"1994","unstructured":"R\u00e9gin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Proc. of the 12th National Conf. on AI, pp. 362\u2013367. AAAI, Menlo Park (1994)"},{"key":"12_CR2","unstructured":"Leconte, M.: A bounds-based reduction scheme for constraints of difference. In: Proc. of 2nd Int. Workshop on Constraint-Based Reasoning, Constraint 1996 (1996)"},{"key":"12_CR3","first-page":"359","volume-title":"15th National Conf. on Artificial Intelligence","author":"J. Puget","year":"1998","unstructured":"Puget, J.: A fast algorithm for the bound consistency of alldiff constraints. In: 15th National Conf. on Artificial Intelligence, pp. 359\u2013366. AAAI, Menlo Park (1998)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-540-45193-8_54","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"C. Bessiere","year":"2003","unstructured":"Bessiere, C., Hentenryck, P.V.: To be or not to be... a global constraint. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 789\u2013794. Springer, Heidelberg (2003)"},{"key":"12_CR5","unstructured":"Bessiere, C., Katsirelos, G., Narodytska, N., Quimper, C.G., Walsh, T.: Decompositions of all different, global cardinality and related constraints. In: Proc. of 21st IJCAI, pp. 419\u2013424 (2009)"},{"key":"12_CR6","unstructured":"Bessiere, C., Katsirelos, G., Narodytska, N., Walsh, T.: Circuit complexity and decompositions of global constraints. In: Proc. of 21st IJCAI, pp. 412\u2013418 (2009)"},{"key":"12_CR7","volume-title":"Proc. of the 19th National Conf. on AI","author":"C. Bessiere","year":"2004","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Walsh, T.: The complexity of global constraints. In: Proc. of the 19th National Conf. on AI. AAAI, Menlo Park (2004)"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/978-3-540-48085-3_24","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"F. Pachet","year":"1999","unstructured":"Pachet, F., Roy, P.: Automatic generation of music programs. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 331\u2013345. Springer, Heidelberg (1999)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/11493853_8","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"C. Bessiere","year":"2005","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: Filtering algorithms for the NVALUE constraint. In: Bart\u00e1k, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol.\u00a03524, pp. 79\u201393. Springer, Heidelberg (2005)"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10601-006-9007-3","volume":"12","author":"C. Bessiere","year":"2007","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Walsh, T.: The complexity of global constraints. Constraints\u00a012, 239\u2013259 (2007)","journal-title":"Constraints"},{"key":"12_CR11","first-page":"235","volume-title":"Proc. of the 23rd National Conf. on AI","author":"C. Bessiere","year":"2008","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Quimper, C.G., Walsh, T.: The parameterized complexity of global constraints. In: Proc. of the 23rd National Conf. on AI, pp. 235\u2013240. AAAI, Menlo Park (2008)"},{"key":"12_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-45578-7_15","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"N. Beldiceanu","year":"2001","unstructured":"Beldiceanu, N.: Pruning for the minimum constraint family and for the number of distinct values constraint family. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 211\u2013224. Springer, Heidelberg (2001)"},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/s10601-006-9001-9","volume":"11","author":"C. Bessiere","year":"2006","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: Filtering algorithms for the NVALUE constraint. Constraints\u00a011, 271\u2013293 (2006)","journal-title":"Constraints"},{"key":"12_CR14","unstructured":"Stergiou, K., Walsh, T.: The difference all-difference makes. In: Proc. of 16th IJCAI (1999)"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"\u00d6sterg\u00e5rd, P., Weakley, W.: Values of domination numbers of the queen\u2019s graph. The Electronic Journal of Combinatorics 8 (2001)","DOI":"10.37236\/1573"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-540-74970-7_39","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"O. Ohrimenko","year":"2007","unstructured":"Ohrimenko, O., Stuckey, P., Codish, M.: Propagation = lazy clause generation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 544\u2013558. Springer, Heidelberg (2007)"},{"key":"12_CR17","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.: Reformulation of Global Constraints Based on Constraints Checkers. Constraints\u00a010, 339\u2013362 (2005)","journal-title":"Constraints"},{"key":"12_CR18","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: The range and roots constraints: Specifying counting and occurrence problems. In: Proc. of 19th IJCAI, pp. 60\u201365 (2005)"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"751","DOI":"10.1007\/11889205_64","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"C.G. Quimper","year":"2006","unstructured":"Quimper, C.G., Walsh, T.: Global grammar constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 751\u2013755. Springer, Heidelberg (2006)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-540-74970-7_42","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"C.G. Quimper","year":"2007","unstructured":"Quimper, C.G., Walsh, T.: Decomposing global grammar constraints. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 590\u2013604. Springer, Heidelberg (2007)"},{"key":"12_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-74970-7_17","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"S. Brand","year":"2007","unstructured":"Brand, S., Narodytska, N., Quimper, C.G., Stuckey, P., Walsh, T.: Encodings of the Sequence Constraint. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 210\u2013224. Springer, Heidelberg (2007)"},{"key":"12_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/11889205_44","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"W.J. Hoeve van","year":"2006","unstructured":"van Hoeve, W.J., Pesant, G., Rousseau, L.M., Sabharwal, A.: Revisiting the Sequence Constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 620\u2013634. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15396-9_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:53:20Z","timestamp":1619772800000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15396-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153952","9783642153969"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15396-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}