{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:12:44Z","timestamp":1767237164298},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540278726"},{"type":"electronic","value":"9783540318828"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11527862_17","type":"book-chapter","created":{"date-parts":[[2010,7,20]],"date-time":"2010-07-20T19:48:01Z","timestamp":1279655281000},"page":"234-247","source":"Crossref","is-referenced-by-count":8,"title":["Compositional Derivation of Symmetries for Constraint Satisfaction"],"prefix":"10.1007","author":[{"given":"Pascal","family":"Van Hentenryck","sequence":"first","affiliation":[]},{"given":"Pierre","family":"Flener","sequence":"additional","affiliation":[]},{"given":"Justin","family":"Pearson","sequence":"additional","affiliation":[]},{"given":"Magnus","family":"\u00c5gren","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-540-48085-3_6","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"R. Backofen","year":"1999","unstructured":"Backofen, R., Will, S.: Excluding symmetries in constraint-based search. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 73\u201387. Springer, Heidelberg (1999)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Bakewell, A., Frisch, A.M., Miguel, I.: Towards automatic modelling of constraint satisfaction problems: A system based on compositional refinement. In: Proceedings of CP 2003 Workshop on Modelling and Reformulating Constraint Satisfaction Problems (2003), Available at \n                    \n                      http:\/\/www-users.cs.york.ac.uk\/~frisch\/Reformulation\/03\/","DOI":"10.1007\/3-540-36607-5_2"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/3-540-46135-3_32","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"N. Barnier","year":"2002","unstructured":"Barnier, N., Brisset, P.: Solving the Kirkman\u2019s schoolgirl problem in a few seconds. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 477\u2013491. Springer, Heidelberg (2002)"},{"issue":"12","key":"17_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N. Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contejean, E.: Introducing global constraints in CHIP. Journal of Mathematical and Computer Modelling\u00a020(12), 97\u2013123 (1994)","journal-title":"Journal of Mathematical and Computer Modelling"},{"key":"17_CR5","unstructured":"Choueiry, B.Y., Noubir, G.: On the computation of local interchangeability in discrete constraint satisfaction problems. In: Proceedings of AAAI 1998, pp. 326\u2013333 (1998)"},{"key":"17_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/3-540-45622-8_6","volume-title":"Abstraction, Reformulation, and Approximation","author":"B.Y. Choueiry","year":"2002","unstructured":"Choueiry, B.Y., Davis, A.M.: Dynamic bundling: Less effort for more solutions. In: Koenig, S., Holte, R.C. (eds.) SARA 2002. LNCS (LNAI), vol.\u00a02371, pp. 64\u201382. Springer, Heidelberg (2002)"},{"key":"17_CR7","unstructured":"Eriksson, M.: Detecting Symmetries in Relational Models of CSPs. Master\u2019s thesis, Computing Science, Department of Information Technology, Uppsala University, Sweden (2005)"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-45578-7_7","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"T. Fahle","year":"2001","unstructured":"Fahle, T., Schamberger, S., Sellmann, M.: Symmetry breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 93\u2013107. Springer, Heidelberg (2001)"},{"key":"17_CR9","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., K\u0131z\u0131ltan, 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\u2013476. Springer, Heidelberg (2002)"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-45578-7_6","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"F. Focacci","year":"2001","unstructured":"Focacci, F., Milano, M.: Global cut framework for removing symmetries. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 77\u201392. Springer, Heidelberg (2001)"},{"issue":"3-4","key":"17_CR11","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1020589922418","volume":"7","author":"F. Focacci","year":"2002","unstructured":"Focacci, F., Lodi, A., Milano, M.: Optimization-oriented global constraints. Constraints\u00a07(3-4), 351\u2013365 (2002)","journal-title":"Constraints"},{"key":"17_CR12","unstructured":"Fox, M., Long, D.: Extending the exploitation of symmetries in planning. In: Proceedings of AIPS 2002 (2002)"},{"key":"17_CR13","unstructured":"Freuder, E.C.: Eliminating interchangeable values in constraint satisfaction problems. In: Proceedings of AAAI 1991, pp. 227\u2013233 (1991)"},{"key":"17_CR14","unstructured":"Gent, I.P., Smith, B.M.: Symmetry breaking during search in constraint programming. In: Proceedings of ECAI 2000, pp. 599\u2013603 (2000)"},{"key":"17_CR15","unstructured":"Gent, I.P., McDonald, I., Miguel, I., Smith, B.M.: Approaches to conditional symmetry breaking. In: Proceedings of SymCon 2004 (2004)"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1287\/ijoc.12.1.2.11900","volume":"12","author":"E. Johnson","year":"2000","unstructured":"Johnson, E., Nemhauser, G., Savelsbergh, M.: Progress in linear programming-based algorithms for integer programming: An exposition. INFORMS Journal on Computing\u00a012, 2\u201323 (2000)","journal-title":"INFORMS Journal on Computing"},{"key":"17_CR17","unstructured":"Lal, A., Choueiry, B.Y.: Dynamic detection and exploitation of value symmetries for non-binary finite CSPs. In: Proceedings of SymCon 2003 (2003)"},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Michel, L., Van Hentenryck, P.: A constraint-based architecture for local search. In: Proceedings of OOPSLA 2002, ACM SIGPLAN Notices, vol.\u00a037(11), pp. 101\u2013110 (2002)","DOI":"10.1145\/583854.582430"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"17_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1007\/3-540-46135-3_30","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"J.-F. Puget","year":"2002","unstructured":"Puget, J.-F.: Symmetry breaking revisited. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 446\u2013461. Springer, Heidelberg (2002)"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-540-45193-8_40","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"J.-F. Puget","year":"2003","unstructured":"Puget, J.-F.: Symmetry breaking using stabilizers. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 585\u2013599. Springer, Heidelberg (2003)"},{"key":"17_CR22","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSPs. In: Proceedings of AAAI 1994 (1994)"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1007\/978-3-540-48085-3_28","volume-title":"Principles and Practice of Constraint Programming \u2013 CP\u201999","author":"J.-C. R\u00e9gin","year":"1999","unstructured":"R\u00e9gin, J.-C.: Arc consistency for global cardinality constraints with costs. In: Jaffar, J. (ed.) CP 1999. LNCS, vol.\u00a01713, pp. 390\u2013404. Springer, Heidelberg (1999)"},{"key":"17_CR24","unstructured":"Roy, P., Pachet, F.: Using symmetry of global constraints to speed up the resolution of constraint satisfaction problems. In: Proceedings of the ECAI 1998 Workshop on Non-Binary Constraints, pp. 27\u201333 (1998)"},{"key":"17_CR25","first-page":"277","volume-title":"Proceedings of IJCAI 2003","author":"P. Hentenryck Van","year":"2003","unstructured":"Van Hentenryck, P., Flener, P., Pearson, J., \u00c5gren, M.: Tractable symmetry breaking for CSPs with interchangeable values. In: Proceedings of IJCAI 2003, pp. 277\u2013282. Morgan Kaufmann, San Francisco (2003)"},{"issue":"4","key":"17_CR26","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1287\/ijoc.14.4.345.2826","volume":"14","author":"P. Hentenryck Van","year":"2002","unstructured":"Van Hentenryck, P.: Constraint and integer programming in OPL. INFORMS Journal on Computing\u00a014(4), 345\u2013372 (2002)","journal-title":"INFORMS Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation and Approximation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11527862_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:23:11Z","timestamp":1558297391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11527862_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540278726","9783540318828"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11527862_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}