An efficient solver for weighted Max-SAT

Authors:
Teresa Alsinet;Felip Manyà;Jordi Planes
Affiliations:
Computer Science Department, Universitat de Lleida, Lleida, Spain 25001;Artificial Intelligence Research Institute (IIIA, CSIC), Bellaterra, Spain 08193;Computer Science Department, Universitat de Lleida, Lleida, Spain 25001
Venue:
Journal of Global Optimization
Year:
2008

Citing 11
Cited 3

Algorithms for the maximum satisfiability problem

Computing
Noise strategies for improving local search

AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Journal of the ACM (JACM)
Reactive search, a history-sensitive heuristic for MAX-SAT

Journal of Experimental Algorithmics (JEA)
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP

Discrete Applied Mathematics
New upper bounds for maximum satisfiability

Journal of Algorithms
A machine program for theorem-proving

Communications of the ACM
Efficient conflict driven learning in a boolean satisfiability solver

Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Approximating the value of two power proof systems, with applications to MAX 2SAT and MAX DICUT

ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Automated theorem proving: A logical basis (Fundamental studies in computer science)

Automated theorem proving: A logical basis (Fundamental studies in computer science)

Pruning search space for weighted first order horn clause satisfiability

ILP'10 Proceedings of the 20th international conference on Inductive logic programming
ABSO: advanced bee swarm optimization metaheuristic and application to weighted MAX-SAT problem

BI'11 Proceedings of the 2011 international conference on Brain informatics
Analyzing pathways using ASP-based approaches

ANB'10 Proceedings of the 4th international conference on Algebraic and Numeric Biology

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new branch and bound algorithm for weighted Max-SAT, called Lazy which incorporates original data structures and inference rules, as well as a lower bound of better quality. We provide experimental evidence that our solver is very competitive and outperforms some of the best performing Max-SAT and weighted Max-SAT solvers on a wide range of instances.