{"type":"ScholarlyArticle","title":"Variable Elimination in Binary CSP via Forbidden Patterns","authors":[{"name":"David A. Cohen","slug":"david-a-cohen","given":"David A.","family":"Cohen","affiliation":""},{"name":"Martin C. Cooper","slug":"martin-c-cooper","given":"Martin C.","family":"Cooper","affiliation":""},{"name":"Guillaume Escamocher","slug":"guillaume-escamocher","given":"Guillaume","family":"Escamocher","affiliation":""},{"name":"Stanislav Zivný","slug":"stanislav-zivny","given":"Stanislav","family":"Zivný","affiliation":""}],"abstract":"A variable elimination rule allows the polynomial-time identification of certain variables whose elimination does not affect the satisfiability of an instance. Variable elimination in the constraint satisfaction problem (CSP) can be used in preprocessing or during search to reduce search space size. We show that there are essentially just four variable elimination rules defined by forbidding generic sub-instances, known as irreducible patterns, in arc-consistent CSP instances. One of these rules is the Broken Triangle Property, whereas the other three are novel.","doi":null,"url":"https://ijcai.org/proceedings/2013/84","pdf":"https://ijcai.org/proceedings/2013/0084.pdf","markdown":"https://ijcai.org/proceedings/2013/84.md","bibtex":"https://ijcai.org/proceedings/2013/bibtex/84","volume":{"slug":"2013","title":"Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2013","url":"https://ijcai.org/proceedings/2013/","year":2013,"location":"Beijing, China","dates":"3–9 August 2013","editors":"Francesca Rossi","isbn":"978-1-57735-633-2","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":84,"pages":{"first":517,"last":522},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}