{"type":"ScholarlyArticle","title":"A Structure-Based Variable Ordering Heuristic for SAT","authors":[{"name":"Jinbo Huang","slug":"jinbo-huang","given":"Jinbo","family":"Huang","affiliation":""},{"name":"Adnan Darwiche","slug":"adnan-darwiche","given":"Adnan","family":"Darwiche","affiliation":""}],"abstract":"We propose a variable ordering heuristic for SAT, which is based on a structural analysis of the SAT problem. We show that when the heuristic is used by a Davis- Putnam SAT solver that employs conflict-directed backtracking, it produces a divide-and-conquer behavior in which the SAT problem is recursively decomposed into smaller problems that are solved independently. We discuss the implications of this divide-and-conquer behavior on our ability to provide structure-based guarantees on the complexity of Davis-Putnam SAT solvers. We also report on the integration of this heuristic with ZChaff-a state-of-the-art SAT solver-showing experimentally that it significantly improves performance on a range of benchmark problems that exhibit structure.","doi":null,"url":"https://ijcai.org/proceedings/2003/166","pdf":"https://ijcai.org/proceedings/2003/0166.pdf","markdown":"https://ijcai.org/proceedings/2003/166.md","bibtex":"https://ijcai.org/proceedings/2003/bibtex/166","volume":{"slug":"2003","title":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2003","url":"https://ijcai.org/proceedings/2003/","year":2003,"location":"Acapulco, Mexico","dates":"","editors":"Georg Gottlob","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":166,"pages":{"first":1167,"last":1171},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}