Thumbnail Image
Publication

Lower bounds and upper bounds for MaxSAT ⋆

Date
2012
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.
Supervisor
Description
peer-reviewed
Publisher
Springer
Citation
Learning and Intelligent OptimizatioN Conference LION 6. Lecture Notes in Computer Science;7219, pp. 402-407
Collections
Lero - The Science Foundation Ireland Research Centre for Software
Show all metadata
Files
Thumbnail Image
Heras_2012_lower.pdf
Adobe PDF, 69.44 KB
Keywords
MaxSAT, software engineering
ULRR Identifiers
https://hdl.handle.net/10344/2768
 https://doi.org/10.34961/850
Funding code
Funding Information
Science Foundation Ireland (SFI)
Sustainable Development Goals
External Link
License
Embedded videos