{"type":"ScholarlyArticle","title":"Heuristics Based on Unit Propagation for Satisfiability Problems","authors":[{"name":"Chu Min Li","slug":"chu-min-li","given":"Chu-Min","family":"Li","affiliation":""},{"name":"Anbulagan","slug":"anbulagan","given":"","family":"Anbulagan","affiliation":""}],"abstract":"The paper studies new unit propagation based heuristics for Davis-Putnam-Loveland (DPL) procedure. These are the novel combinations of unit propagation and the usual \"Maximum Occurrences in clauses of Minimum Size\" heuristics. Based on the experimental evaluations of different alternatives a new simple unit propagation based heuristic is put forward. This compares favorably with the heuristics employed in the current state-of-the-art DPL implementations (C-SAT, Tableau, POSIT).","doi":null,"url":"https://ijcai.org/proceedings/1997/54","pdf":"https://ijcai.org/proceedings/1997/0054.pdf","markdown":"https://ijcai.org/proceedings/1997/54.md","bibtex":"https://ijcai.org/proceedings/1997/bibtex/54","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":54,"pages":{"first":366,"last":370},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}