{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:36:00Z","timestamp":1725489360569},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540738169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73817-6_2","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T03:59:13Z","timestamp":1187409553000},"page":"33-47","source":"Crossref","is-referenced-by-count":1,"title":["An Attempt to Dynamically Break Symmetries in the Social Golfers Problem"],"prefix":"10.1007","author":[{"given":"Francisco","family":"Azevedo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","unstructured":"Anderson, I., Honkala, I.: A Short Course in Combinatorial Designs (1997), http:\/\/www.utu.fi\/~honkala\/cover.html"},{"key":"2_CR2","volume-title":"Frontiers of Artificial Intelligence and Applications","author":"F. Azevedo","year":"2003","unstructured":"Azevedo, F.: Constraint Solving over Multi-valued Logics - Application to Digital Circuits. In: Frontiers of Artificial Intelligence and Applications, vol.\u00a091, IOS Press, Amsterdam (2003)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Azevedo, F.: Cardinal: A Finite Sets Constraint Solver. Constraints journal KAP (to appear, 2007)","DOI":"10.1007\/s10601-006-9012-6"},{"key":"2_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/3-540-44957-4_28","volume-title":"Computational Logic - CL 2000","author":"F. Azevedo","year":"2000","unstructured":"Azevedo, F., Barahona, P.: Modelling Digital Circuits Problems with Set Constraints. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 414\u2013428. Springer, Heidelberg (2000)"},{"key":"2_CR5","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)"},{"key":"2_CR6","unstructured":"Beldiceanu, N.: An Example of Introduction of Global Constraints in CHIP: Application to Block Theory Problems. Technical Report TR-LP-49. ECRC, Munich, Germany (1990)"},{"key":"2_CR7","unstructured":"Choueiry, Noubir: On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems. In: Proc. AAAI 1998 (1998)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Colbourn, C.J., Dinitz, J.H. (eds.): Steiner Triple Systems. CRC Handbook of Combinatorial Designs, vol. 70, pp. 14\u201315, CRC Press, Boca Raton, FL (1996)","DOI":"10.1201\/9781420049954"},{"key":"2_CR9","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., Shamberger, S., Sellmann, M.: Symmetry Breaking. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, pp. 93\u2013107. Springer, Heidelberg (2001)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","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. 75\u201392. Springer, Heidelberg (2001)"},{"key":"2_CR11","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.: Groups and Constraints: Symmetry Breaking During Search. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol.\u00a02470, pp. 415\u2013430. Springer, Heidelberg (2002)"},{"key":"2_CR12","unstructured":"Gent, I.P., Smith, B.M.: Symmetry Breaking During Search in Constraint Programming. In: Proc. ECAI 2000 (2000)"},{"key":"2_CR13","doi-asserted-by":"crossref","unstructured":"Gervet, C.: Interval Propagation to Reason about Sets: Definition and Implementation of a Practical Language. In: Freuder, E.C. (ed.): Constraints journal, vol. 1(3), pp. 191\u2013244, Kluwer Academic Publishers (1997)","DOI":"10.1007\/BF00137870"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"W. Harvey","year":"2001","unstructured":"Harvey, W.: Symmetry Breaking and the Social Golfer Problem. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, Springer, Heidelberg (2001)"},{"key":"2_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"706","DOI":"10.1007\/978-3-540-30549-1_61","volume-title":"AI 2004: Advances in Artificial Intelligence","author":"P. Hawkins","year":"2004","unstructured":"Hawkins, P., Lagoon, V., Stuckey, P.J.: Set Bounds and (Split) Set Domain Propagation Using ROBDDs. In: Webb, G.I., Yu, X. (eds.) AI 2004. LNCS (LNAI), vol.\u00a03339, pp. 706\u2013717. Springer, Heidelberg (2004)"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Van Hentenryck, P.: A Logic Language for Combinatorial Optimization. In: Annals of Operations Research (1989)","DOI":"10.1007\/BF02022102"},{"key":"2_CR17","unstructured":"Kirkman, T.P.: On a problem in combinatorics. Cambridge and Dublin Math. Journal, 191\u2013204 (1847)"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Kiziltan, Z.: Symmetry Breaking Ordering Constraints. PhD thesis, Uppsala University (2004)","DOI":"10.1007\/978-3-540-45193-8_103"},{"key":"2_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/978-3-540-30201-8_27","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"V. Lagoon","year":"2004","unstructured":"Lagoon, V., Stuckey, P.J.: Set Domain Propagation Using ROBDDs. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 347\u2013361. Springer, Heidelberg (2004)"},{"key":"2_CR20","series-title":"Annals of Discrete Mathematics","volume-title":"Topics on Steiner Systems","author":"C.C. Lindner","year":"1980","unstructured":"Lindner, C.C., Rosa, A.: Topics on Steiner Systems. Annals of Discrete Mathematics, vol.\u00a07. North Holland, Amsterdam (1980)"},{"key":"2_CR21","unstructured":"Lueneburg, H.: Tools and Fundamental Constructions of Combinatorial Mathematics, Wissenschaftverlag (1989)"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0004-3702(01)00104-7","volume":"129","author":"P. Meseguer","year":"1999","unstructured":"Meseguer, P., Torras, C.: Exploiting Symmetries Within Constraint Satisfaction Search. Art.Intell.\u00a0129, 133\u2013163 (1999)","journal-title":"Art.Intell."},{"key":"2_CR23","unstructured":"Puget, J.-F.: PECOS: A High Level Constraint programming Language. In: Proc. Spicis 92, Singapore (1992)"},{"key":"2_CR24","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":"2_CR25","series-title":"Lecture Notes in Computer Science","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, Springer, Heidelberg (2003)"},{"key":"2_CR26","unstructured":"Roney-Dougal, C.M., Gent, I.P., Kelsey, T., Linton, S.A.: Tractable symmetry breaking using restricted search trees. In: Proceedings of ECAI 2004 (2004)"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Sellmann, M., Harvey, W.: Heuristic Constraint Propagation. In: Proceedings of CPAIOR 2002 workshop, pp. 191\u2013204 (2002)","DOI":"10.1007\/3-540-46135-3_55"}],"container-title":["Lecture Notes in Computer Science","Recent Advances in Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73817-6_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T20:47:40Z","timestamp":1684010860000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73817-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540738169"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73817-6_2","relation":{},"subject":[]}}