Study of lower bound functions for MAX-2-SAT

Authors:
Haiou Shen;Hantao Zhang
Affiliations:
Computer Science Department, The University of Iowa, Iowa City, IA;Computer Science Department, The University of Iowa, Iowa City, IA
Venue:
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Year:
2004

Citing 7
Cited 17

Algorithms for the maximum satisfiability problem

Computing
Parameterizing above guaranteed values: MaxSat and MaxCut

Journal of Algorithms
New upper bounds for maximum satisfiability

Journal of Algorithms
A machine program for theorem-proving

Communications of the ACM
sub-SAT: a formulation for relaxed boolean satisfiability with applications in routing

Proceedings of the 2002 international symposium on Physical design
New Worst-Case Upper Bounds for SAT

Journal of Automated Reasoning
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search

Theoretical Computer Science

MaxSolver: an efficient exact algorithm for (weighted) maximum satisfiability

Artificial Intelligence
Improving exact algorithms for MAX-2-SAT

Annals of Mathematics and Artificial Intelligence
A logical approach to efficient Max-SAT solving

Artificial Intelligence
Detecting disjoint inconsistent subformulas for computing lower bounds for Max-SAT

AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
New inference rules for Max-SAT

Journal of Artificial Intelligence Research
MINIMAXSAT: an efficient weighted max-SAT solver

Journal of Artificial Intelligence Research
Exploiting inference rules to compute lower bounds for MAX-SAT solving

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Resolution in Max-SAT and its relation to local consistency in weighted CSPs

IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability

Artificial Intelligence
Partial max-SAT solvers with clause learning

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
MiniMaxSAT: a new weighted Max-SAT solver

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
On inconsistent clause-subsets for Max-SAT solving

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
A Max-SAT inference-based pre-processing for Max-clique

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Resolution-based lower bounds in MaxSAT

Constraints
Solving over-constrained problems with SAT technology

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Improved exact solvers for weighted Max-SAT

SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
A complete calculus for Max-SAT

SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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, linear-time lower bound function. We show that the new lower bound function is admissible and it is consistently and substantially better than other known lower bound functions. The result of this study is a high-performance implementation of an exact algorithm for MAX-2-SAT which outperforms any implementation of the same class.