{"type":"ScholarlyArticle","title":"A Comparison of Structural CSP Decomposition Methods","authors":[{"name":"Georg Gottlob","slug":"georg-gottlob","given":"Georg","family":"Gottlob","affiliation":""},{"name":"Nicola Leone","slug":"nicola-leone","given":"Nicola","family":"Leone","affiliation":""},{"name":"Francesco Scarcello","slug":"francesco-scarcello","given":"Francesco","family":"Scarcello","affiliation":""}],"abstract":"We compare tractab le classes of constraint satisfaction problems (CSPs) . We first give a uniform prese ntation of the major structural CSP decomposition m et hods. We then introduce a new class of tractable CSPs based on the concept of hypertree decomposition recently developed in Database Theory. We introduce a framework for comparing parametric decomposition-based m et hods according to tractability criteria and compare the most relevant methods. We show that the method of hypertree decomposition dominates the others in the case of general (nonbinary) CSPs.","doi":null,"url":"https://ijcai.org/proceedings/1999/57","pdf":"https://ijcai.org/proceedings/1999/0057.pdf","markdown":"https://ijcai.org/proceedings/1999/57.md","bibtex":"https://ijcai.org/proceedings/1999/bibtex/57","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":57,"pages":{"first":394,"last":398},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}