SAT-based MaxSAT algorithms

Many industrial optimization problems can be translated to MaxSAT. Although the general problem is NP hard, like SAT, many practical problems may be solved using modern MaxSAT solvers. In this paper we present several algorithms specially designed to deal with industrial or real problems. All of the...

Full description

Saved in:
Bibliographic Details
Published inArtificial intelligence Vol. 196; pp. 77 - 105
Main Authors Ansótegui, Carlos, Bonet, Maria Luisa, Levy, Jordi
Format Journal Article
LanguageEnglish
Published Oxford Elsevier B.V 01.03.2013
Elsevier
Subjects
Algorithmics. Computability. Computer arithmetics
Applied sciences
Boolean optimization
Computer science; control theory; systems
Exact sciences and technology
MaxSAT
SAT
Theoretical computing
MaxSAT
SAT
Boolean optimization
Maximum satisfiability
Boolean logic
NP hard problem
Problem solving
Constraint satisfaction
Satisfiability problem
Optimization
Mathematical programming
Online AccessGet full text

Cover

More Information
Summary:Many industrial optimization problems can be translated to MaxSAT. Although the general problem is NP hard, like SAT, many practical problems may be solved using modern MaxSAT solvers. In this paper we present several algorithms specially designed to deal with industrial or real problems. All of them are based on the idea of solving MaxSAT through successive calls to a SAT solver. We show that this SAT-based technique is efficient in solving industrial problems. In fact, all state-of-the-art MaxSAT solvers that perform well in industrial instances are based on this technique. In particular, our solvers won the 2009 partial MaxSAT and the 2011 weighted partial MaxSAT industrial categories of the MaxSAT evaluation. We prove the correctness of all our algorithms. We also present a complete experimental study comparing the performance of our algorithms with latest MaxSAT solvers.
ISSN:0004-3702
1872-7921
DOI:10.1016/j.artint.2013.01.002