A New Encoding from MinSAT into MaxSAT
نویسندگان
چکیده
MinSAT is the problem of finding a truth assignment that minimizes the number of satisfied clauses in a CNF formula. When we distinguish between hard and soft clauses, and soft clauses have an associated weight, then the problem, called Weighted Partial MinSAT, consists in finding a truth assignment that satisfies all the hard clauses and minimizes the sum of weights of satisfied soft clauses. In this paper we define a novel encoding from Weighted Partial MinSAT into Weighted Partial MaxSAT, which is also valid for encoding Weighted Partial MaxSAT into Weighted Partial MinSAT. Moreover, we report on an empirical investigation that shows that our encoding significantly outperforms existing encodings on weighted and unweighted Min2SAT and Min3SAT instances.
منابع مشابه
MinSAT versus MaxSAT for Optimization Problems
Despite their similarities, MaxSAT and MinSAT use different encodings and solving techniques to cope with optimization problems. In this paper we describe a new weighted partial MinSAT solver, define original MinSAT encodings for relevant combinatorial problems, propose a new testbed for evaluating MinSAT, report on an empirical investigation comparing MinSAT with MaxSAT, and provide new insigh...
متن کاملExact MinSAT Solving
We present an original approach to exact MinSAT solving based on solving MinSAT using MaxSAT encodings and MaxSAT solvers, and provide empirical evidence that our generic approach is competitive.
متن کاملMinimum Satisfiability and Its Applications
We define solving techniques for theMinimum Satisfiability Problem (MinSAT), propose an efficient branch-and-bound algorithm to solve the Weighted Partial MinSAT problem, and report on an empirical evaluation of the algorithm onMin-3SAT,MaxClique, and combinatorial auction problems. Techniques solving MinSAT are substantially different from those for the Maximum Satisfiability Problem (MaxSAT)....
متن کاملMaximal Falsifiability - Definitions, Algorithms, and Applications
Similarly to Maximum Satisfiability (MaxSAT), Minimum Satisfiability (MinSAT) is an optimization extension of the Boolean Satisfiability (SAT) decision problem. In recent years, both problems have been studied in terms of exact and approximation algorithms. In addition, the MaxSAT problem has been characterized in terms of Maximal Satisfiable Subsets (MSSes) and Minimal Correction Subsets (MCSe...
متن کاملAn Exact Inference Scheme for MinSAT
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 a...
متن کامل