A Proof Builder for Max-SAT
نویسندگان
چکیده
Complete Max-SAT solvers are able to return the optimal value of an input instance but they do not provide any certificate its validity. In this paper, we introduce for first time a proof builder, called MS-Builder, which generates proofs under particular form sequence equivalence-preserving transformations. To generate proof, MS-Builder iteratively calls SAT oracle get refutation is handled and adapted into sound Max-SAT. We also propose extendable tool, MS-Checker, verify validity using inference rules.
منابع مشابه
Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT
MAX SAT and MAX NAE-SAT are central problems in theoretical computer science. We present an approximation algorithm for MAX NAE-SAT with a conjectured performance guarantee of 0.8279. This improves a previously conjectured performance guarantee of 0.7977 of Zwick [Zwi99]. Using a variant of our MAX NAE-SAT approximation algorithm, combined with other techniques used in [Asa03], we obtain an app...
متن کاملResolution for Max-SAT
Max-SAT is the problem of finding an assignment minimizing the number of unsatisfied clauses in a CNF formula. We propose a resolution-like calculus for Max-SAT and prove its soundness and completeness. We also prove the completeness of some refinements of this calculus. From the completeness proof we derive an exact algorithm for Max-SAT and a time upper bound. We also define a weighted Max-SA...
متن کاملA Max-SAT Inference-Based Pre-processing for Max-Clique
In this paper we propose the use of two resolution-based rules for the Max-SAT encoding of the Maximum Clique Problem. These rules simplify the problem instance in such a way that a lower bound of the optimum becomes explicit. Then, we present a pre-processing procedure that applies such rules. Empirical results show evidence that the lower bound obtained with the preprocessing outperforms prev...
متن کاملA Parallel GRASP for MAX-SAT Problems
The weighted maximum satis ability MAX SAT problem is central in mathematical logic computing theory and many indus trial applications In this paper we present a parallel greedy randomized adaptive search procedure GRASP for solving MAX SAT problems Experimental results indicate that almost linear speedup is achieved
متن کاملA New Algorithm for Parameterized MAX-SAT
We show how to check whether at least k clauses of an input formula in CNF can be satisfied in time O∗(1.358k). This improves the bound O∗(1.370k) proved by Chen and Kanj more than 10 years ago. Though the presented algorithm is based on standard splitting techniques its core are new simplification rules that often allow to reduce the size of case analysis. Our improvement is based on a simple ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-80223-3_33