Proceedings

An Exact Inference Scheme for MinSAT

Download BibTeX Cite

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence. Main Track. Pages 1959-1964.

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.

Chu-Min Li, and Felip Manyà. 2015. An Exact Inference Scheme for MinSAT. In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI-15. IJCAI, 1959–1964. https://ijcai.org/proceedings/2015/278
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards