{"type":"ScholarlyArticle","title":"Symmetry Breaking via LexLeader Feasibility Checkers","authors":[{"name":"Justin Yip","slug":"justin-yip","given":"Justin","family":"Yip","affiliation":""},{"name":"Pascal Van Hentenryck","slug":"pascal-van-hentenryck","given":"Pascal","family":"Van Hentenryck","affiliation":""}],"abstract":"This paper considers matrix models, a class of CSPs which generally exhibit significant symmetries. It proposed the idea of LexLeader feasibility checkers that verify, during search, whether the current partial assignment can be extended into a canonical solution. The feasibility checkers are based on a novel result by [Katsirelos et al., 2010] on how to check efficiently whether a solution is canonical. The paper generalizes this result to partial assignments, various variable orderings, and value symmetries. Empirical results on 5 standard benchmarks shows that feasibility checkers may bring significant performance gains, when jointly used with DoubleLex or SnakeLex.","doi":"10.5591/978-1-57735-516-8/IJCAI11-121","url":"https://ijcai.org/proceedings/2011/121","pdf":"https://ijcai.org/proceedings/2011/0121.pdf","markdown":"https://ijcai.org/proceedings/2011/121.md","bibtex":"https://ijcai.org/proceedings/2011/bibtex/121","volume":{"slug":"2011","title":"Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2011","url":"https://ijcai.org/proceedings/2011/","year":2011,"location":"Barcelona, Catalonia, Spain","dates":"16–22 July 2011","editors":"Toby Walsh","isbn":"978-1-57735-512-0; 978-1-57735-513-7; 978-1-57735-514-4; 978-1-57735-515-1; 978-1-57735-516-8","publisher":"AAAI Press/International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":121,"pages":{"first":687,"last":691},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}