A MAX-SAT Algorithm Portfolio

Authors:
Paulo Matos;Jordi Planes;Florian Letombe;João Marques-Silva
Affiliations:
School of Electronics & Computer Science, University of Southampton, UK, email: pocm@ecs.soton.ac.uk;School of Electronics & Computer Science, University of Southampton, UK, email: jp3@ecs.soton.ac.uk;School of Electronics & Computer Science, University of Southampton, UK, email: fl@ecs.soton.ac.uk;School of Electronics & Computer Science, University of Southampton, UK, email: jpms@ecs.soton.ac.uk
Venue:
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Year:
2008

Citing 11
Cited 0

Branch and bound algorithm selection by performance prediction

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Algorithm portfolios

Artificial Intelligence - special issue on computational tradeoffs under bounded resources
Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions

CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Propositional Satisfiability and Constraint Programming: A comparative survey

ACM Computing Surveys (CSUR)
A logical approach to efficient Max-SAT solving

Artificial Intelligence
Improved Design Debugging Using Maximum Satisfiability

FMCAD '07 Proceedings of the Formal Methods in Computer Aided Design
Algorithms for maximum satisfiability using unsatisfiable cores

Proceedings of the conference on Design, automation and test in Europe
New inference rules for Max-SAT

Journal of Artificial Intelligence Research
A portfolio approach to algorithm select

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
SATzilla-07: the design and analysis of an algorithm portfolio for SAT

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
sub-SAT: a formulation for relaxed Boolean satisfiability with applications in routing

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The results of the last MaxSAT Evaluations suggest there is no universal best algorithm for solving MaxSAT, as the fastest solver often depends on the type of instance. Having an oracle able to predict the most suitable MaxSAT solver for a given instance would result in the most robust solver. Inspired by the success of SATzilla for SAT, this paper describes the first approach for a portfolio of algorithms for MaxSAT. Compared to existing solvers, the resulting portfolio can achieve significant performance improvements on a representative set of instances.