{"type":"ScholarlyArticle","title":"Tractable Symmetry Breaking for CSPs with Interchangeable Values","authors":[{"name":"Pascal Van Hentenryck","slug":"pascal-van-hentenryck","given":"Pascal","family":"Van Hentenryck","affiliation":"Department of Computer Science Brown University , Box 1910 Providence , RI 02912"},{"name":"Pierre Flener","slug":"pierre-flener","given":"Pierre","family":"Flener","affiliation":"Department of Information Technology Uppsala University , Box 337 S-751 OS Uppsala , Sweden"},{"name":"Justin Pearson","slug":"justin-pearson","given":"Justin","family":"Pearson","affiliation":"Department of Information Technology Uppsala University , Box 337 S-751 OS Uppsala , Sweden"},{"name":"Magnus Ågren","slug":"magnus-agren","given":"Magnus","family":"Ågren","affiliation":"Department of Information Technology Uppsala University , Box 337 S-751 OS Uppsala , Sweden"}],"abstract":"Symmetry breaking in CSPs has attracted considerable attention in recent years. Various general schemes have been proposed to eliminate symmetries during search. In general, these schemes may take exponential space or time to eliminate all symmetries. This paper studies classes of CSPs for which symmetry breaking is tractable. It identifies several CSP classes which feature various forms of value interchangeability and shows that symmetry breaking can be performed in constant time and space during search using dedicated search procedures. Experimental results also show the benefits of symmetry breaking on these CSPs, which encompass many practical applications.","doi":null,"url":"https://ijcai.org/proceedings/2003/41","pdf":"https://ijcai.org/proceedings/2003/0041.pdf","markdown":"https://ijcai.org/proceedings/2003/41.md","bibtex":"https://ijcai.org/proceedings/2003/bibtex/41","volume":{"slug":"2003","title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2003","url":"https://ijcai.org/proceedings/2003/","year":2003,"location":"Acapulco, Mexico","dates":"","editors":"Georg Gottlob","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":41,"pages":{"first":277,"last":283},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Backofen and Will, 1999] RolfBackofen and Sebastian Will. Ex- cluding symmetries in constraint-based search. In CP'99.","title":"RolfBackofen and Sebastian Will. Excluding symmetries in constraint-based search","authors":"Will Backofen","year":"1999","venue":"CP'99","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Barnier and Brisset, 2002] N. Barnier and P. Brisset. Solving the Kirkman's schoolgirl problem in a few seconds. In CP'2002.","title":"Solving the Kirkman's schoolgirl problem in a few seconds","authors":"N Barnier, P Brisset","year":null,"venue":"CP'2002","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Camerson, 1999] P. Cameron. Permutation Groups, Cambridge Univ. Press, 1999.","title":"Permutation Groups","authors":"P Cameron","year":"1999","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Crawford et al., 1996] J. Crawford eta!. Symmetry breaking pred- icates for search problems. In KR'96.","title":"Symmetry breaking predicates for search problems","authors":"J Crawford","year":null,"venue":"KR'96","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Fahle et al., 2001] Schamberger Fahle, Torsten, Stefan, and Meinolf Sellmann. Symmetry breaking. In CP'2001.","title":"Symmetry breaking","authors":"Schamberger Fahle, Stefan Torsten, Meinolf Sellmann","year":null,"venue":"CP'2001","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"Filippo Focacci and Michaela Milano. Global cut framework for removing symmetries. In CP'200 I.","title":"Global cut framework for removing symmetries","authors":"Filippo Focacci, Michaela Milano","year":null,"venue":"CP'200 I","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Freuder, 1991] E. Freuder. Eliminating interchangeable values in constraint satisfaction problems. In Proc. AAAI'91.","title":"Eliminating interchangeable values in constraint satisfaction problems","authors":"E Freuder","year":null,"venue":"Proc. AAAI'91","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Gent and Smith, 2000] Ian P. Gent and B. Smith. Symmetry break- ing during search in constraint programming. In ECAI'2000.","title":"Symmetry breaking during search in constraint programming","authors":"Ian P Gent, B Smith","year":null,"venue":"ECAI'2000","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Kubale and Jackowski, 1985] M. Kubale and D. Jackowski. A Generalized Implicit Enumeration Algorithm for Graph Color- ing. CACM, 28(4):412-418, 1985.","title":"A Generalized Implicit Enumeration Algorithm for Graph Coloring","authors":"M Kubale, D Jackowski","year":"1985","venue":"CACM","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Meseguer and Torras, 2001] P. Meseguer and C. Torras. Exploit- ing symmetries within constraint satisfaction search. Artificial Intelligence, 129(1-2):133-163, 2001.","title":"Exploiting symmetries within constraint satisfaction search","authors":"P Meseguer, C Torras","year":"2001","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Puget, 1993] J.-F. Puget. On the satisfi ability of symmetrical con- strained satisfaction problems. In ISMIS'93.","title":"On the satisfi ability of symmetrical constrained satisfaction problems","authors":"J.-F Puget","year":null,"venue":"ISMIS'93","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Puget, 2002] J.-F. Puget. Symmetry Breaking Revisited. In CP'2002.","title":"Symmetry Breaking Revisited","authors":"J.-F Puget","year":null,"venue":"CP'2002","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Van Hentenryck, 2002] P. Van Hentenryck. Constraint and In- teger Programming in OPL. Informs Journal on Computing, 14(4):345-372, 2002.","title":"Constraint and Integer Programming in OPL","authors":"P Van Hentenryck","year":"2002","venue":"Informs Journal on Computing","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}