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.
This work was partially supported by SFI PI grant BEACON (09/IN.1/I2618).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ansótegui, C., Bonet, M.L., Levy, J.: A new algorithm for weighted partial MaxSAT. In: AAAI (2010)
Le Berre, D., Parrain, A.: The Sat4j library, release 2.2. JSAT 7, 59–64 (2010)
Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability (2009)
Fu, Z., Malik, S.: On Solving the Partial MAX-SAT Problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 252–265. Springer, Heidelberg (2006)
Giunchiglia, E., Maratea, M.: Solving optimization problems with DLL. In: ECAI, pp. 377–381 (August 2006)
Heras, F., Manquinho, V.M., Marques-Silva, J.: On applying unit propagation-based lower bounds in pseudo-boolean optimization. In: FLAIRS Conference, pp. 71–76 (2008)
Heras, F., Morgado, A., Marques-Silva, J.: Core-guided binary search algorithms for maximum satisfiability. In: AAAI (2011)
Hoos, H.H.: An adaptive noise mechanism for WalkSAT. In: AAAI, pp. 655–660 (2002)
Kroc, L., Sabharwal, A., Gomes, C.P., Selman, B.: Integrating systematic and local search paradigms: A new strategy for MaxSAT. In: IJCAI, pp. 544–551 (2009)
Li, C.-M., Manyà , F., Planes, J.: Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 403–414. Springer, Heidelberg (2005)
Marques-Silva, J., Planes, J.: On using unsatisfiability for solving maximum satisfiability. Computing Research Repository, abs/0712.0097 (December 2007)
Marques-Silva, J., Planes, J.: Algorithms for maximum satisfiability using unsatisfiable cores. In: DATE, pp. 408–413 (2008)
Menai, M.E., Batouche, M.: An effective heuristic algorithm for the maximum satisfiability problem. Appl. Intell. 24(3), 227–239 (2006)
Morgado, A., Heras, F., Marques-Silva, J.: The MSUnCore MaxSAT solver. In: POS (2011)
Sellmann, M., Kadioglu, S.: Dichotomic Search Protocols for Constrained Optimization. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 251–265. Springer, Heidelberg (2008)
Tompkins, D.A.D., Hoos, H.H.: UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 306–320. Springer, Heidelberg (2005)
Zhang, L., Malik, S.: Validating sat solvers using an independent resolution-based checker: Practical implementations and other applications. In: DATE, pp. 10880–10885 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Heras, F., Morgado, A., Marques-Silva, J. (2012). Lower Bounds and Upper Bounds for MaxSAT. In: Hamadi, Y., Schoenauer, M. (eds) Learning and Intelligent Optimization. LION 2012. Lecture Notes in Computer Science, vol 7219. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34413-8_35
Download citation
DOI: https://doi.org/10.1007/978-3-642-34413-8_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34412-1
Online ISBN: 978-3-642-34413-8
eBook Packages: Computer ScienceComputer Science (R0)