{"type":"ScholarlyArticle","title":"Computing Optimal Hypertree Decompositions with SAT","authors":[{"name":"Andre Schidler","slug":"andre-schidler","given":"Andre","family":"Schidler","affiliation":""},{"name":"Stefan Szeider","slug":"stefan-szeider","given":"Stefan","family":"Szeider","affiliation":""}],"abstract":"Hypertree width is a prominent hypergraph invariant with many\r\n  algorithmic applications in constraint satisfaction and\r\n  databases. We propose a novel characterization for hypertree width\r\n  in terms of linear elimination orderings. We utilize this\r\n  characterization to generate a new SAT encoding that we evaluate on\r\n  an extensive set of benchmark instances. We compare it to\r\n  state-of-the-art exact methods for computing optimal hypertree\r\n  width. Our results show that the encoding based on the new\r\n  characterization is not only significantly more compact than known\r\n  encodings but also outperforms the other methods.","doi":"10.24963/ijcai.2021/196","url":"https://ijcai.org/proceedings/2021/196","pdf":"https://ijcai.org/proceedings/2021/0196.pdf","markdown":"https://ijcai.org/proceedings/2021/196.md","bibtex":"https://ijcai.org/proceedings/2021/bibtex/196","volume":{"slug":"2021","title":"Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2021","url":"https://ijcai.org/proceedings/2021/","year":2021,"location":"Montreal","dates":"19-27 August 2021","editors":"Prof. Zhi-Hua Zhou","isbn":"978-0-9992411-9-6","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2021"},"section":"Constraints and SAT","track":"Main Track","number":196,"pages":{"first":1418,"last":1424},"keywords":["Constraints and SAT: Satisfiability Modulo Theories","Constraints and SAT: Constraints: Modeling, Solvers, Applications","Constraints and SAT: Constraint Satisfaction"],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}