{"type":"ScholarlyArticle","title":"Solving Strategies for Highly Symmetric CSPs","authors":[{"name":"Pedro Meseguer","slug":"pedro-meseguer","given":"Pedro","family":"Meseguer","affiliation":""},{"name":"Carme Torras","slug":"carme-torras","given":"Carme","family":"Torras","affiliation":""}],"abstract":"Symmetry often appears in real-world constraint satisfaction problems, but strategies for exploiting it are only beginning to be developed. Here, a rationale for exploiting symmetry within depth-first search is proposed, leading to an heuristic for variable selection and a domain pruning procedur e. These strategies are then applied to a highly symmetric comb inat orial problem, namely the generation of balanced incomplete block designs. Experimental results show that these strategies achieve a reduction of up to two orders of magnitude in computational effort. Int erestingly, two previously developed strategies are shown to be particular instances of this approach.","doi":null,"url":"https://ijcai.org/proceedings/1999/58","pdf":"https://ijcai.org/proceedings/1999/0058.pdf","markdown":"https://ijcai.org/proceedings/1999/58.md","bibtex":"https://ijcai.org/proceedings/1999/bibtex/58","volume":{"slug":"1999","title":"Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1999","url":"https://ijcai.org/proceedings/1999/","year":1999,"location":"Stockholm, Sweden","dates":"","editors":"Thomas Dean","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Constraint Satisfaction","track":"Constraint Satisfaction","number":58,"pages":{"first":400,"last":404},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}