{"type":"ScholarlyArticle","title":"Structuring Techniques for Constraint Satisfaction Problems","authors":[{"name":"Rainer Weigel","slug":"rainer-weigel","given":"Rainer","family":"Weigel","affiliation":""},{"name":"Boi Faltings","slug":"boi-faltings","given":"Boi","family":"Faltings","affiliation":""}],"abstract":"We present a structuring method for discrete constraint satisfaction problems (CSPs). It takes advantage of interchangeabilities to represent sets of equivalent values by meta-values and thus obtain more compact representations. Strongly related variables are clustered into meta-variables to create occurrences of interchangeabilities. By iterative application, a CSP can be transformed into an hierarchy of equivalent CSPs, where each problem is significantly simpler than the original one. This structure is particularly advantageous when a large set of possible solutions must be inspected.","doi":null,"url":"https://ijcai.org/proceedings/1997/62","pdf":"https://ijcai.org/proceedings/1997/0062.pdf","markdown":"https://ijcai.org/proceedings/1997/62.md","bibtex":"https://ijcai.org/proceedings/1997/bibtex/62","volume":{"slug":"1997","title":"Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1997","url":"https://ijcai.org/proceedings/1997/","year":1997,"location":"Nagoya, Japan","dates":"","editors":"Martha E. Pollack","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Constraint Satisfaction","track":"Constraint Satisfaction","number":62,"pages":{"first":418,"last":422},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}