SAT 2004 START ConferenceManager    


Engineering an Efficient Max-SAT Solver

Xiao Yu Li and Matthias F. Stallmann and Franc Brglez

Presented at The Seventh International Conference on Theory and Applications of Satisfiability Testing (SAT 2004), Vancouver, BC, Canada, 10-13 May 2004


Abstract

A new branch-and-bound max-sat solver QTMAX integrates many of the best features of existing solvers to achieve superior performance, especially on larger benchmark problems. To challenge the solver, we adapted benchmarks from hard set-cover and vertex-cover problems. This work reveals the limitations of current solver technology and suggests the need for more sophisticated algorithms.


  
START Conference Manager (V2.47.2)
Maintainer: rrgerber@softconf.com