A MAX-SAT Algorithm Portfolio

9 years 11 months ago
A MAX-SAT Algorithm Portfolio
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.
Paulo J. Matos, Jordi Planes, Florian Letombe, Jo&
Added 19 Oct 2010
Updated 19 Oct 2010
Type Conference
Year 2008
Where ECAI
Authors Paulo J. Matos, Jordi Planes, Florian Letombe, João Marques-Silva
Comments (0)