Abstract
We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy*) which incorporate original data structures and inference rules, and a lower bound of better quality.
Research partially supported by projects TIN2004-07933-C03-03 and TIC2003-00950 funded by the Ministerio de Educación y Ciencia. The second author is supported by a grant Ramón y Cajal.
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
Alber, J., Gramm, J., Niedermeier, R.: Faster exact algorithms for hard problems: A parameterized point of view. In: Rovan, B. (ed.) SOFSEM 1998. LNCS, vol. 1521, pp. 168–185. Springer, Heidelberg (1998)
Alsinet, T., Manyà, F., Planes, J.: Improved branch and bound algorithms for Max-SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)
Borchers, B., Furman, J.: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. J. of Combinatorial Optimization 2, 299–306 (1999)
de Givry, S., Larrosa, J., Meseguer, P., Schiex, T.: Solving Max-SAT as weighted CSP. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 363–376. Springer, Heidelberg (2003)
Jeroslow, R.G., Wang, J.: Solving propositional satisfiability problems. Annals of Mathematics and Artificial Intelligence 1, 167–187 (1990)
Niedermeier, R., Rossmanith, P.: New upper bounds for maximum satisfiability. Journal of Algorithms 36, 63–88 (2000)
Pretolani, D.: Efficiency and stability of hypergraph SAT algorithms. In: Proceedings of the DIMACS Challenge II Workshop (1993)
Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of AAAI 2002, pp. 440–446 (1992)
Shen, H., Zhang, H.: Study of lower bound functions for max-2-sat. In: Proceedings of AAAI 2004, pp. 185–190 (2004)
Wallace, R., Freuder, E.: Comparative studies of constraint satisfaction and Davis-Putnam algorithms for maximum satisfiability problems. In: Cliques, Coloring and Satisfiability, vol. 26, pp. 587–615 (1996)
Xing, Z., Zhang, W.: Efficient strategies for (weighted) maximum satisfiability. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 690–705. Springer, Heidelberg (2004)
Zhang, H., Shen, H., Manya, F.: Exact algorithms for MAX-SAT. In: 4th Int. Workshop on First order Theorem Proving (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Alsinet, T., Manyà, F., Planes, J. (2005). Improved Exact Solvers for Weighted Max-SAT. In: Bacchus, F., Walsh, T. (eds) Theory and Applications of Satisfiability Testing. SAT 2005. Lecture Notes in Computer Science, vol 3569. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499107_27
Download citation
DOI: https://doi.org/10.1007/11499107_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26276-3
Online ISBN: 978-3-540-31679-4
eBook Packages: Computer ScienceComputer Science (R0)