{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:48:42Z","timestamp":1725896922730},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642319501"},{"type":"electronic","value":"9783642319518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31951-8_3","type":"book-chapter","created":{"date-parts":[[2012,7,21]],"date-time":"2012-07-21T00:56:20Z","timestamp":1342832180000},"page":"7-13","source":"Crossref","is-referenced-by-count":0,"title":["Exploiting Constraints"],"prefix":"10.1007","author":[{"given":"Toby","family":"Walsh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Foundations of Artificial Intelligence. Elsevier (2006)"},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-540-45193-8_4","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"T. Walsh","year":"2003","unstructured":"Walsh, T.: Constraint Patterns. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 53\u201364. Springer, Heidelberg (2003)"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","volume":"10","author":"J. Lauriere","year":"1978","unstructured":"Lauriere, J.: Alice: A language and a program for solving combinatorial problems. Artificial Intelligence\u00a010, 29\u2013127 (1978)","journal-title":"Artificial Intelligence"},{"key":"3_CR4","unstructured":"R\u00e9gin, J.C.: A filtering algorithm for constraints of difference in CSPs. In: Proc. of the 12th National Conf. on AI, AAAI, pp. 362\u2013367 (1994)"},{"key":"3_CR5","unstructured":"Bessi\u00e8re, C., Katsirelos, G., Narodytska, N., Quimper, C.G., Walsh, T.: Decompositions of all different, global cardinality and related constraints. In: Proc. of the 21st Int. Joint Conf. on Artificial Intelligence (2009)"},{"key":"3_CR6","unstructured":"Leconte, M.: A bounds-based reduction scheme for constraints of difference. In: Proc. of Second Int. Workshop on Constraint-based Reasoning (Constraint 1996) (1996)"},{"key":"3_CR7","unstructured":"Puget, J.: A fast algorithm for the bound consistency of alldiff constraints. In: 15th National Conf. on Artificial Intelligence, AAAI, pp. 359\u2013366 (1998)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/3-540-45349-0_23","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"K. Mehlhorn","year":"2000","unstructured":"Mehlhorn, K., Thiel, S.: Faster Algorithms for Bound-Consistency of the Sortedness and the Alldifferent Constraint. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 306\u2013319. Springer, Heidelberg (2000)"},{"key":"3_CR9","unstructured":"Lopez-Ortiz, A., Quimper, C., Tromp, J., van Beek, P.: A fast and simple algorithm for bounds consistency of the alldifferent constraint. In: Proc. of the 18th Int. Joint Conf. on AI, IJCAI (2003)"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/3-540-45349-0_32","volume-title":"Principles and Practice of Constraint Programming - CP 2000","author":"T. Walsh","year":"2000","unstructured":"Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol.\u00a01894, pp. 441\u2013456. Springer, Heidelberg (2000)"},{"key":"3_CR11","unstructured":"Gent, I., Prosser, P., Smith, B.: A 0\/1 encoding of the GACLex constraint for pairs of vectors. In: Proc. of ECAI 2002 Workshop on Modelling and Solving Problems with Constraints (2002)"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-642-15396-9_12","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"C. Bessiere","year":"2010","unstructured":"Bessiere, C., Katsirelos, G., Narodytska, N., Quimper, C.-G., Walsh, T.: Decomposition of the NValue Constraint. In: Cohen, D. (ed.) CP 2010. LNCS, vol.\u00a06308, pp. 114\u2013128. Springer, Heidelberg (2010)"},{"issue":"4-6","key":"3_CR13","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1017\/S1471068410000220","volume":"10","author":"C. Drescher","year":"2010","unstructured":"Drescher, C., Walsh, T.: A translational approach to constraint answer set solving. Theory and Practice of Logic Programming\u00a010(4-6), 465\u2013480 (2010)","journal-title":"Theory and Practice of Logic Programming"},{"key":"3_CR14","unstructured":"Drescher, C., Walsh, T.: Modelling GRAMMAR constraints with answer set programming. In: Proc. of the 27th Int. Conf. on Logic Programming, ICLP 2011 (2011)"},{"key":"3_CR15","unstructured":"Drescher, C., Walsh, T.: Translation-based constraint answer set solving. In: Proc. of the 22nd Int. Joint Conf. on Artificial Intelligence, IJCAI (2011)"},{"key":"3_CR16","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":"3_CR17","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Katsirelos, G., Narodytska, N., Quimper, C.G., Walsh, T.: Propagating conjunctions of alldifferent constraints. In: Proc. of the Twenty-Fourth AAAI Conf. on Artificial Intelligence (AAAI 2010). AAAI (2010)","DOI":"10.1609\/aaai.v24i1.7554"},{"key":"3_CR18","unstructured":"Bessi\u00e8re, C., Katsirelos, G., Narodytska, N., Walsh, T.: Circuit complexity and decompositions of global constraints. In: Proc. of the 21st Int. Joint Conf. on Artificial Intelligence, IJCAI (2009)"},{"key":"3_CR19","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.J., Walsh, T.: Encodings of the Sequence Constraint. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 210\u2013224. Springer, Heidelberg (2007)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1007\/978-3-540-85958-1_11","volume-title":"Principles and Practice of Constraint Programming","author":"M. Maher","year":"2008","unstructured":"Maher, M., Narodytska, N., Quimper, C.-G., Walsh, T.: Flow-Based Propagators for the SEQUENCE and Related Global Constraints. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 159\u2013174. Springer, Heidelberg (2008)"},{"key":"3_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-540-30201-8_28","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"Y.C. Law","year":"2004","unstructured":"Law, Y.C., Lee, J.H.M.: Global Constraints for Integer and Set Value Precedence. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 362\u2013376. Springer, Heidelberg (2004)"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1007\/11889205_46","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"T. Walsh","year":"2006","unstructured":"Walsh, T.: General Symmetry Breaking Constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 650\u2013664. Springer, Heidelberg (2006)"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1007\/978-3-540-74970-7_67","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"T. Walsh","year":"2007","unstructured":"Walsh, T.: Breaking Value Symmetry. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 880\u2013887. Springer, Heidelberg (2007)"},{"key":"3_CR24","unstructured":"Walsh, T.: Breaking value symmetry. In: Proc. of the 23rd National Conf. on AI, AAAI, pp. 1585\u20131588 (2008)"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Walsh, T.: Symmetry breaking using value precedence. In: Proc. of the 17th European Conf. on Artificial Intelligence (ECAI 2006). IOS Press (2006)","DOI":"10.1007\/11941439_4"},{"key":"3_CR26","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: The range and roots constraints: Specifying counting and occurrence problems. In: Proc. of the 19th Int. Joint Conf. on Artificial Intelligence, IJCAI, pp. 60\u201365 (2005)"},{"key":"3_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11757375_7","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"C. Bessi\u00e8re","year":"2006","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: The Range Constraint: Algorithms and Implementation. In: Beck, J.C., Smith, B.M. (eds.) CPAIOR 2006. LNCS, vol.\u00a03990, pp. 59\u201373. Springer, Heidelberg (2006)"},{"key":"3_CR28","doi-asserted-by":"crossref","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Walsh, T.: The complexity of global constraints. In: Proc. of the 19th National Conf. on AI, AAAI (2004)","DOI":"10.1007\/978-3-540-30201-8_53"},{"key":"3_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/11889205_8","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"C. Bessiere","year":"2006","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: The ROOTS Constraint. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 75\u201390. Springer, Heidelberg (2006)"},{"key":"3_CR30","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-73580-9_9","volume-title":"Abstraction, Reformulation, and Approximation","author":"C. Bessiere","year":"2007","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Quimper, C.-G., Walsh, T.: Reformulating Global Constraints: The Slide and Regular Constraints. In: Miguel, I., Ruml, W. (eds.) SARA 2007. LNCS (LNAI), vol.\u00a04612, pp. 80\u201392. Springer, Heidelberg (2007)"},{"key":"3_CR31","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: SLIDE: a useful special case of the CardPath constraint. In: Proc. of the 18th European Conf. on Artificial Intelligence (ECAI 2008). IOS Press (2008)"},{"issue":"2","key":"3_CR32","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10601-006-9007-3","volume":"12","author":"C. Bessi\u00e8re","year":"2007","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., Walsh, T.: The complexity of global constraints. Constraints\u00a012(2), 239\u2013259 (2007)","journal-title":"Constraints"},{"key":"3_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-540-74970-7_12","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"F. Bacchus","year":"2007","unstructured":"Bacchus, F.: GAC Via Unit Propagation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol.\u00a04741, pp. 133\u2013147. Springer, Heidelberg (2007)"},{"key":"3_CR34","unstructured":"Carlsson, M., Beldiceanu, N.: Arc-consistency for a chain of lexicographic ordering constraints. Tech. rep. T2002-18, Swedish Institute of Computer Science (2002)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31951-8_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T15:19:14Z","timestamp":1687619954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31951-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642319501","9783642319518"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31951-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}