{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T11:24:30Z","timestamp":1725708270121},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642351006"},{"type":"electronic","value":"9783642351013"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35101-3_18","type":"book-chapter","created":{"date-parts":[[2012,11,29]],"date-time":"2012-11-29T16:40:16Z","timestamp":1354207216000},"page":"206-217","source":"Crossref","is-referenced-by-count":1,"title":["The RegularGcc Matrix Constraint"],"prefix":"10.1007","author":[{"given":"Ronald","family":"de Haan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nina","family":"Narodytska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toby","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-13520-0_4","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"N. Beldiceanu","year":"2010","unstructured":"Beldiceanu, N., Carlsson, M., Flener, P., Pearson, J.: On Matrices, Automata, and Double Counting. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 10\u201324. Springer, Heidelberg (2010)"},{"key":"18_CR2","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)"},{"key":"18_CR3","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Walsh, T.: The complexity of global constraints. In: Proc. of 19th National Conf. on AI. Association for Advancement of Artificial Intelligence (2004)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1007\/978-3-540-30201-8_53","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"C. Bessi\u00e8re","year":"2004","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., Walsh, T.: The Tractability of Global Constraints. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 716\u2013720. Springer, Heidelberg (2004)"},{"key":"18_CR5","unstructured":"Crawford, J., Luks, G., Ginsberg, M., Roy, A.: Symmetry breaking predicates for search problems. In: Proc. of the 5th Int. Conf. on Knowledge Representation and Reasoning (KR 1996), pp. 148\u2013159 (1996)"},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/3-540-46135-3_31","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"P. Flener","year":"2002","unstructured":"Flener, P., Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Pearson, J., Walsh, T.: Breaking Row and Column Symmetries in Matrix Models. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 462\u2013477. Springer, Heidelberg (2002)"},{"key":"18_CR7","unstructured":"Flener, P., Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Matrix modelling. Tech. Rep. APES-36-2001, APES group (2001); presented at Formul 2001 Workshop on Modelling and Problem Formulation, CP 2001"},{"key":"18_CR8","unstructured":"Flener, P., Frisch, A., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Matrix modelling: Exploiting common patterns in constraint programming. In: Proc. of the Int. Workshop on Reformulating Constraint Satisfaction Problems (2002); held alongside CP 2002"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/978-3-540-30201-8_23","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"L. Hellsten","year":"2004","unstructured":"Hellsten, L., Pesant, G., van Beek, P.: A Domain Consistency Algorithm for the Stretch Constraint. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 290\u2013304. Springer, Heidelberg (2004)"},{"key":"18_CR10","unstructured":"Katsirelos, G., Narodytska, N., Quimper, C., Walsh, T.: Global matrix constraints. In: Proc. of the Int. Workshop on Constraint Modelling and Reformulation, pp. 27\u201341 (2011), held alongside CP 2011"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-642-03251-6_6","volume-title":"Recent Advances in Constraints","author":"G. Katsirelos","year":"2009","unstructured":"Katsirelos, G., Narodytska, N., Walsh, T.: Combining Symmetry Breaking and Global Constraints. In: Oddi, A., Fages, F., Rossi, F. (eds.) CSCLP 2008. LNCS, vol.\u00a05655, pp. 84\u201398. Springer, Heidelberg (2009)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-642-15396-9_26","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"G. Katsirelos","year":"2010","unstructured":"Katsirelos, G., Narodytska, N., Walsh, T.: On the Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry. In: Cohen, D. (ed.) CP 2010. LNCS, vol.\u00a06308, pp. 305\u2013320. Springer, Heidelberg (2010)"},{"key":"18_CR13","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.J. Maher","year":"2008","unstructured":"Maher, M.J., 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":"18_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":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/3-540-56804-2_33","volume-title":"Methodologies for Intelligent Systems","author":"J.F. Puget","year":"1993","unstructured":"Puget, J.F.: On the Satisfiability of Symmetrical Constrained Satisfaction Problems. In: Komorowski, J., Ra\u015b, Z.W. (eds.) ISMIS 1993. LNCS, vol.\u00a0689, pp. 350\u2013361. Springer, Heidelberg (1993)"},{"key":"18_CR16","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":"18_CR17","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":"18_CR18","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":"18_CR19","unstructured":"Yip, J., Hentenryck, P.V.: Symmetry breaking via lexleader feasibility checkers. In: Walsh, T. (ed.) Proc. of the 22nd Int. Joint Conf. on Artificial Intelligence (IJCAI 2011). pp. 687\u2013692. IJCAI\/AAAI (2011)"}],"container-title":["Lecture Notes in Computer Science","AI 2012: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35101-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,9]],"date-time":"2019-05-09T10:15:05Z","timestamp":1557396905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35101-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642351006","9783642351013"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35101-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}