{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:26:09Z","timestamp":1725560769106},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540292388"},{"type":"electronic","value":"9783540320500"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11564751_21","type":"book-chapter","created":{"date-parts":[[2005,10,18]],"date-time":"2005-10-18T13:31:28Z","timestamp":1129642288000},"page":"256-270","source":"Crossref","is-referenced-by-count":16,"title":["Conditional Symmetry Breaking"],"prefix":"10.1007","author":[{"given":"Ian P.","family":"Gent","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Kelsey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steve A.","family":"Linton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iain","family":"McDonald","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Miguel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara M.","family":"Smith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Choi, C., Lee, J.H.: On the pruning behavior of minimal combined models for CSPs. In: Proceedings of the Workshop on Reformulating Constraint Satisfaction Problems (2002)"},{"key":"21_CR2","unstructured":"Crawford, J., Ginsberg, M.L., Luks, E., Roy, A.: Symmetry-breaking Predicates for Search Problems. In: Proc. of the 5th KRR, pp. 148\u2013159 (1996)"},{"key":"21_CR3","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":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-46135-3_7","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"A.M. Frisch","year":"2002","unstructured":"Frisch, A.M., Hnich, B., Kiziltan, Z., Miguel, I., Walsh, T.: Global Constraints for Lexicographic Orderings. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 93\u2013108. Springer, Heidelberg (2002)"},{"key":"21_CR5","unstructured":"Frisch, A.M., Miguel, I., Walsh, T.: Symmetry and Implied Constraints in the Steel Mill Slab Design Problem. In: Proc. Formul 2001, pp. 8\u201315 (2001)"},{"key":"21_CR6","unstructured":"Gallian, J.A.: Graph Labeling. The Electronic Journal of Combinatorics, Dynamic Surveys (DS6) (2003), \n                    \n                      www.combinatorics.org\/Surveys"},{"key":"21_CR7","unstructured":"Gent, I.P., Jefferson, C.A., Lynce, I., Miguel, I., Nightingale, P., Smith, B.M., Tarim, A.: Search in the Patience Game Black Hole CP Pod Research Report 10 (2005)"},{"key":"21_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1007\/3-540-46135-3_28","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"I.P. Gent","year":"2002","unstructured":"Gent, I.P., Harvey, W., Kelsey, T.W.: Groups and Constraints: Symmetry Breaking During Search. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 415\u2013430. Springer, Heidelberg (2002)"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-45193-8_23","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"I.P. Gent","year":"2003","unstructured":"Gent, I.P., Harvey, W., Kelsey, T.W., Linton, S.A.: Generic SBDD Using Computational Group Theory. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 333\u2013347. Springer, Heidelberg (2003)"},{"key":"21_CR10","unstructured":"Gent, I.P., McDonald, I., Smith, B.M.: Conditional Symmetry in the All-Interval Series Problem. In: Proc. SymCon 2003 (2003)"},{"key":"21_CR11","unstructured":"Parlett, D.: The Penguin Book of Patience. Penguin (1980)"},{"key":"21_CR12","unstructured":"Puget, J.-F., R\u00e9gin, J.-C.: Solving the all-interval problem, Available from \n                    \n                      http:\/\/www.csplib.org"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming - CP 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11564751_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T14:23:05Z","timestamp":1552832585000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11564751_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540292388","9783540320500"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11564751_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}