A Proof Builder for Max-SAT

Matthieu Py,Mohamed Sami Cherif,Djamal Habet

doi:10.1007/978-3-030-80223-3_33

A Proof Builder for Max-SAT

Matthieu Py, Mohamed Sami Cherif + Show 1 more

Open Access

https://doi.org/10.1007/978-3-030-80223-3_33

Copy DOI

Publication Date: Jan 1, 2021

Citations: 5

Affiliation: Université de Toulon, Laboratoire d’Informatique et Systèmes, French National Centre for Scientific Research

#Sequence Of Transformations #Equivalence-preserving Transformations + Show 3 more

Abstract
Full-Text PDF
Similar Papers

Abstract

AbstractComplete Max-SAT solvers are able to return the optimal value of an input instance but they do not provide any certificate of its validity. In this paper, we introduce for the first time a Max-SAT proof builder, called MS-Builder, which generates Max-SAT proofs under the particular form of a sequence of Max-SAT equivalence-preserving transformations. To generate a Max-SAT proof, MS-Builder iteratively calls a SAT oracle to get a SAT refutation which is handled and adapted into a sound refutation for Max-SAT. We also propose an extendable tool, called MS-Checker, able to verify the validity of any proof using Max-SAT inference rules.KeywordsMax-SATProofMax-SAT resolution

Full Text