Abstract
This paper presents several ways to compute lower and upper bounds for MaxSAT based on calling a complete SAT solver. Preliminary results indicate that (i) the bounds are of high quality, (ii) the bounds can boost the search of MaxSAT solvers on some benchmarks, and (iii) the upper bounds computed by a Stochastic Local Search procedure (SLS) can be substantially improved when its search is initialized with an assignment provided by a complete SAT solver. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Heras, F., Morgado, A., & Marques-Silva, J. (2012). Lower bounds and upper bounds for MaxSAT. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7219 LNCS, pp. 402–407). https://doi.org/10.1007/978-3-642-34413-8_35
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
