Abstract
We investigate the use of many-valued clausal forms as an intermediate formalism between CSP and SAT for solving combinatorial problems. In this research programme, we have recently designed and implemented a complete many-valued SAT solver called Mv-Satz [1], which builds on the popular Boolean solver Satz, and conducted an experimental investigation that provides evidence that Mv-Satz outperforms Satz and zChaff on a number of problems.
Research partially supported by project CICYT TIC2001-1577-C03-03 funded by the Ministerio de Ciencia y Tecnología.
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
References
Ansótegui, C., Larrubia, J., Li, C.M., Manyà, F.: Mv-Satz: A SAT solver for many-valued clausal forms. In: 4th International Conference Journées de L’Informatique Messine, JIM 2003, Metz, France (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ansótegui, C. (2003). A New Approach to Solving SAT-Encoded Binary CSPs. In: Rossi, F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45193-8_87
Download citation
DOI: https://doi.org/10.1007/978-3-540-45193-8_87
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20202-8
Online ISBN: 978-3-540-45193-8
eBook Packages: Springer Book Archive