Exploiting the power of MIP solvers in MAXSAT

Authors:
Jessica Davies;Fahiem Bacchus
Affiliations:
Department of Computer Science, University of Toronto, Toronto, Ontario, Canada;Department of Computer Science, University of Toronto, Toronto, Ontario, Canada
Venue:
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Year:
2013

Citing 9
Cited 0

Planning and Scheduling by Logic-Based Benders Decomposition

Operations Research
Algorithms for Weighted Boolean Optimization

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
MINIMAXSAT: an efficient weighted max-SAT solver

Journal of Artificial Intelligence Research
Resolution-based lower bounds in MaxSAT

Constraints
Implicit hitting set problems and multi-genome alignment

CPM'10 Proceedings of the 21st annual conference on Combinatorial pattern matching
On improving MUS extraction algorithms

SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Solving MAXSAT by solving a sequence of simpler SAT instances

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Algorithms for implicit hitting set problems

Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Improving SAT-Based weighted MaxSAT solvers

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

maxsat is an optimization version of satisfiability. Since many practical problems involve optimization, there are a wide range of potential applications for effective maxsat solvers. In this paper we present an extensive empirical evaluation of a number of maxsat solvers. In addition to traditional maxsat solvers, we also evaluate the use of a state-of-the-art Mixed Integer Program (mip) solver, cplex, for solving maxsat. mip solvers are the most popular technology for solving optimization problems and are also theoretically more powerful than sat solvers. In fact, we show that cplex is quite effective on a range of maxsat instances. Based on these observations we extend a previously developed hybrid approach for solving maxsat, that utilizes both a sat solver and a mip solver. Our extensions aim to take better advantage of the power of the mip solver. The resulting improved hybrid solver is shown to be quite effective.