Title
Iterative and core-guided MaxSAT solving: A survey and assessment
Abstract
Maximum Satisfiability (MaxSAT) is an optimization version of SAT, and many real world applications can be naturally encoded as such. Solving MaxSAT is an important problem from both a theoretical and a practical point of view. In recent years, there has been considerable interest in developing efficient algorithms and several families of algorithms have been proposed. This paper overviews recent approaches to handle MaxSAT and presents a survey of MaxSAT algorithms based on iteratively calling a SAT solver which are particularly effective to solve problems arising in industrial settings. First, classic algorithms based on iteratively calling a SAT solver and updating a bound are overviewed. Such algorithms are referred to as iterative MaxSAT algorithms. Then, more sophisticated algorithms that additionally take advantage of unsatisfiable cores are described, which are referred to as core-guided MaxSAT algorithms. Core-guided MaxSAT algorithms use the information provided by unsatisfiable cores to relax clauses on demand and to create simpler constraints. Finally, a comprehensive empirical study on non-random benchmarks is conducted, including not only the surveyed algorithms, but also other state-of-the-art MaxSAT solvers. The results indicate that (i) core-guided MaxSAT algorithms in general abort in less instances than classic solvers based on iteratively calling a SAT solver and that (ii) core-guided MaxSAT algorithms are fairly competitive compared to other approaches.
Year
DOI
Venue
2013
10.1007/s10601-013-9146-2
Constraints
Keywords
Field
DocType
unsatisfiable core,core-guided maxsat,classic algorithm,state-of-the-art maxsat solvers,recent approach,maxsat algorithm,iterative maxsat algorithm,classic solvers,sat solver,recent year,core-guided maxsat algorithm,optimization problems,maxsat
Maximum satisfiability problem,Mathematical optimization,On demand,Boolean satisfiability problem,Satisfiability,Boolean optimization,Optimization problem,Empirical research,Mathematics
Journal
Volume
Issue
ISSN
18
4
1572-9354
Citations 
PageRank 
References 
60
1.35
114
Authors
5
Search Limit
100114
Name
Order
Citations
PageRank
Antonio Morgado11125.27
Federico Heras247921.37
Mark H. Liffiton351820.71
Jordi Planes448631.38
Joao Marques-Silva51947124.04