{"type":"ScholarlyArticle","title":"An Exact Inference Scheme for MinSAT","authors":[{"name":"Chu Min Li","slug":"chu-min-li","given":"Chu-Min","family":"Li","affiliation":""},{"name":"Felip Manyà","slug":"felip-manya","given":"Felip","family":"Manyà","affiliation":""}],"abstract":"We describe an exact inference-based algorithm for the MinSAT problem. Given a multiset of clauses Φ, the algorithm derives as many empty clauses as the maximum number of clauses that can be falsified in Φ by applying finitely many times an inference rule, and returns an optimal assignment. We prove the correctness of the algorithm, describe how it can be extended to deal with weighted MinSAT and weighted partial MinSAT instances, analyze the differences between the MaxSAT and MinSAT inference schemes, and define and empirically evaluate the MinSAT Pure Literal Rule.","doi":null,"url":"https://ijcai.org/proceedings/2015/278","pdf":"https://ijcai.org/proceedings/2015/0278.pdf","markdown":"https://ijcai.org/proceedings/2015/278.md","bibtex":"https://ijcai.org/proceedings/2015/bibtex/278","volume":{"slug":"2015","title":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2015","url":"https://ijcai.org/proceedings/2015/","year":2015,"location":"Buenos Aires, Argentina","dates":"25–31 July 2015","editors":"Qiang Yang and Michael Wooldridge","isbn":"978-1-57735-738-4","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Satisfiability","track":"Main Track","number":278,"pages":{"first":1959,"last":1964},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}