Study of Lower Bound Functions for MAX-2-SAT
نویسندگان
چکیده
Recently, several lower bound functions are proposed for solving the MAX-2-SAT problem optimally in a branch-and-bound algorithm. These lower bounds improve significantly the performance of these algorithms. Based on the study of these lower bound functions, we propose a new, liner-time lower bound function. We show that the new lower bound function is consistently and substantially better than other known lower bound functions. The result of this study is a highperformance implementation of an exact algorithm for MAX-2-SAT which outperforms any implementation of the same class.
منابع مشابه
Exploiting Inference Rules to Compute Lower Bounds for MAX-SAT Solving
In this paper we present a general logical framework for (weighted)MAX-SAT problem, and study properties of inference rules for branch and bound MAX-SAT solver. Several rules, which are not equivalent but Λ-equivalent, are proposed, and we show that Λ-equivalent rules are also sound. As an example, we show how to exploit inference rules to achieve a new lower bound function for a MAX2-SAT solve...
متن کاملAn efficient solver for weighted Max-SAT
We present a new branch and bound algorithm for weighted Max-SAT, called 1 Lazy which incorporates original data structures and inference rules, as well as a lower 2 bound of better quality. We provide experimental evidence that our solver is very competi3 tive and outperforms some of the best performing Max-SAT and weighted Max-SAT solvers 4 on a wide range of instances. 5
متن کاملDetecting Disjoint Inconsistent Subformulas for Computing Lower Bounds for Max-SAT
Many lower bound computation methods for branch and bound Max-SAT solvers can be explained as procedures that search for disjoint inconsistent subformulas in the Max-SAT instance under consideration. The difference among them is the technique used to detect inconsistencies. In this paper, we define five new lower bound computation methods: two of them are based on detecting inconsistencies via ...
متن کاملImproved Branch and Bound Algorithms for Max-2-SAT and Weighted Max-2-SAT
We present novel branch and bound algorithms for solving Max-SAT and weighted Max-SAT, and provide experimental evidence that outperform the algorithm of Borchers & Furman on Max-2-SAT and weighted Max-2-SAT instances. Our algorithms decrease the time needed to solve an instance, as well as the number of backtracks, up to two orders of magnitude.
متن کاملImproved Exact Solvers for Weighted Max-SAT
We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy) which incorporate original data structures and inference rules, and a lower bound of better quality.
متن کامل