Abstract
One of the main differences between complete SAT solvers and exact Max-SAT solvers is that the former make an intensive use of unit propagation at each node of the proof tree while the latter, in order to ensure optimality, can only apply unit propagation to a restricted number of nodes. In this paper, we describe a branch and bound Max-SAT solver that applies unit propagation at each node of the proof tree to compute the lower bound instead of applying unit propagation to simplify the formula. The new lower bound captures the lower bound based on inconsistency counts that apply most of the state-of-the-art Max-SAT solvers as well as other improvements, like the start rule, that have been defined to get a lower bound of better quality. Moreover, our solver incorporates the Jeroslow-Wang variable selection heuristic, the pure literal and dominating unit clause rules, and novel preprocessing techniques. The experimental investigation we conducted to compare our solver with the most modern Max-SAT solvers provides experimental evidence that our solver is very competitive.
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: 25th Conf. on Current Trends in Theory and Practice of Informatics. LNCS, pp. 168–185. Springer, Heidelberg (1998)
Alsinet, T., Manyà, F., Planes, J.: Improved branch and bound algorithms for Max-SAT. In: Proceedings of the 6th International Conference on the Theory and Applications of Satisfiability Testing (2003)
Alsinet, T., Manyà, F., Planes, J.: A Max-SAT solver with lazy data structures. In: Lemaître, C., Reyes, C.A., González, J.A. (eds.) IBERAMIA 2004. LNCS (LNAI), vol. 3315, pp. 334–342. Springer, Heidelberg (2004)
Alsinet, T., Manyà, F., Planes, J.: Improved exact solvers for weighted Max-SAT. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 371–377. Springer, Heidelberg (2005)
Borchers, B., Furman, J.: A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems. Journal 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)
Goldberg, E., Novikov, Y.: BerkMin: A fast and robust SAT solver. In: Proceedings of Design, Automation and Test in Europe, DATE 2002, Paris, France, pp. 142–149. IEEE Computer Society, Los Alamitos (2001)
Hooker, J.N., Vinay, V.: Branching rules for satisfiability. Journal of Automated Reasoning 15, 359–383 (1995)
Jeroslow, R.G., Wang, J.: Solving propositional satisfiability problems. Annals of Mathematics and Artificial Intelligence 1, 167–187 (1990)
Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI 1997, Nagoya, Japan, pp. 366–371. Morgan Kaufmann, San Francisco (1997)
Li, C.M., Anbulagan: Look-ahead versus look-back for satisfiability problems. In: Smolka, G. (ed.) CP 1997. LNCS, vol. 1330, pp. 341–355. Springer, Heidelberg (1997)
Marques-Silva, J.P., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Transactions on Computers 48(5), 506–521 (1999)
Meseguer, P., Bouhmala, N., Bouzoubaa, T., Irgens, M., Sánchez, M.: Current approaches for solving over-constrained problems. Constraints 8(1), 9–39 (2003)
Niedermeier, R., Rossmanith, P.: New upper bounds for maximum satisfiability. Journal of Algorithms 36, 63–88 (2000)
Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of the 10th National Conference on Artificial Intelligence, AAAI 1992, San Jose/CA, USA, pp. 440–446. AAAI Press, Menlo Park (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: Johnson, D., Trick, M. (eds.) 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.: SATO: An efficient propositional prover. In: Conference on Automated Deduction (CADE 1997), pp. 272–275 (1997)
Zhang, H., Shen, H., Manya, F.: Exact algorithms for MAX-SAT. In: 4th Int. Workshop on First order Theorem Proving (June 2003)
Zhang, L., Madigan, C., Moskewicz, M., Malik, S.: Efficient conflict driven learning in a Boolean satisfiability solver. In: International Conference on Computer Aided Design, ICCAD 2001, San Jose/CA, USA, pp. 279–285 (2001)
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
Li, C.M., Manyà, F., Planes, J. (2005). Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_31
Download citation
DOI: https://doi.org/10.1007/11564751_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29238-8
Online ISBN: 978-3-540-32050-0
eBook Packages: Computer ScienceComputer Science (R0)