On Using Unsatisfiability for Solving Maximum Satisfiability

Details On Using Unsatisfiability for Solving Maximum Satisfiability On Using Unsatisfiability for Solving Maximum Satisfiability

2007-12-07

arxiv.org/abs/0712.1097v1

Computer Science

Artificial Intelligence

Scientific paper

Maximum Satisfiability (MaxSAT) is a well-known optimization pro- blem, with several practical applications. The most widely known MAXS AT algorithms are ineffective at solving hard problems instances from practical application domains. Recent work proposed using efficient Boolean Satisfiability (SAT) solvers for solving the MaxSAT problem, based on identifying and eliminating unsatisfiable subformulas. However, these algorithms do not scale in practice. This paper analyzes existing MaxSAT algorithms based on unsatisfiable subformula identification. Moreover, the paper proposes a number of key optimizations to these MaxSAT algorithms and a new alternative algorithm. The proposed optimizations and the new algorithm provide significant performance improvements on MaxSAT instances from practical applications. Moreover, the efficiency of the new generation of unsatisfiability-based MaxSAT solvers becomes effectively indexed to the ability of modern SAT solvers to proving unsatisfiability and identifying unsatisfiable subformulas.

Affiliated with

Also associated with

No associations

Rating

On Using Unsatisfiability for Solving Maximum Satisfiability does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Using Unsatisfiability for Solving Maximum Satisfiability, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Using Unsatisfiability for Solving Maximum Satisfiability will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-120334