Abstract
We present a new complete multi-valued SAT solver, based on current state-of-the-art SAT technology. It features watched literal propagation and conflict driven clause learning. We combine this technology with state-of-the-art CP methods for branching and introduce quantitative supports which augment the watched literal scheme with a watched domain size scheme. Most importantly, we adapt SAT nogood learning for the multi-valued case and demonstrate that exploiting the knowledge that each variable must take exactly one out of many values can lead to much stronger nogoods. Experimental results assess the benefits of these contributions and show that solving multi-valued SAT directly often works better than reducing multi-valued constraint problems to SAT.
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.
Similar content being viewed by others
References
Ansótegui, C.: Complete SAT solvers for Many-Valued CNF Formulas. PhD thesis, Universitat de Lleida (2004)
Ansótegui, C., Larrubia, J., Manyà, F.: Boosting chaff’s performance by incorporating CSP heuristics. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 96–107. Springer, Heidelberg (2003)
Ansótegui, C., Manyà, F.: Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables. In: Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 1–15. Springer, Heidelberg (2005)
Ansótegui, C., Larrubia, J., Liu, C., Manyà, F.: Exploiting multivalued knowledge in variable selection heuristics for SAT solvers. Ann. Math. Artif. Intell. 49(1-4), 191–205 (2007)
Bessiere, C.: http://www.lirmm.fr/~bessiere/generator.html
Boussemart, F., Lecoutre, F., Sais, C.: Boosting systematic search by weighting constraints. In: ECAI, pp. 146–150 (2004)
Eén, N., Sörensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)
Frisch, A., Peugniez, T.: Solving Non-Boolean Satisfiability Problems with Stochastic Local Search. In: IJCAI, pp. 282–288 (2001)
Graph coloring instances, http://mat.gsia.cmu.edu/COLOR/instances.html
Gent, I.: Arc consistency in SAT. In: ECAI, pp. 121–125 (2002)
Katsirelos, G.: Nogood Processing in CSPs. PhD Thesis, University of Toronto (2009)
Li, C., Anbulagan, A.: Heuristics based on unit propagation for satisfiability problems. In: IJCAI, pp. 366–371 (1997)
Liu, C., Kuehlmann, A., Moskewicz, M.: CAMA: A Multi-Valued Satisfiability Solver. In: ICCAD, pp. 326–333 (2003)
Mitchell, D.: Resolution and Constraint Satisfaction. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 554–569. Springer, Heidelberg (2003)
Ohrimenko, O., Stuckey, P., Codish, M.: Propagation=Lazy Clause Generation. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 544–558. Springer, Heidelberg (2007)
Prosser, P.: An empirical study of phase transitions in binary constraint satisfaction problems. Frontiers in Problem Solving: Phase Transitions and Complexity 81(1-2), 81–109 (1996)
Refalo, P.: Impact-Based Search Strategies for Constraint Programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557–571. Springer, Heidelberg (2004)
Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an Efficient SAT Solver. In: DAC, pp. 530–535 (2001)
Schiex, T., Verfaille, G.: Nogood Recording for Static and Dynamic Constraint Satisfaction Problems. In: JAIT, pp. 48–55 (1994)
Selman, B., Kautz, H., Cohen, B.: Local Search Strategies for Satisfiability Testing. In: DIMACS, pp. 521–532 (1995)
International, C.S.P.: Competition Result Pages., http://bach.istc.kobe-u.ac.jp/sugar/cpai08.html , http://bach.istc.kobe-u.ac.jp/sugar/csc09.html
Tamura, N., Taga, A., Banbara, M.: System Description of a SAT-based CSP solver Sugar. In: CPAI (2008), http://bach.istc.kobe-u.ac.jp/sugar/cpai08-sugar.pdf
Tamura, N., Taga, A., Kitagawa, S., Banbara, M.: Compiling Finite Linear CSP into SAT. Constraints 14, 254–272 (2009)
Walsh, T.: SAT vs CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 441–456. Springer, Heidelberg (2000)
Zhang, L., Madigan, C., Moskewicz, M., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: ICCAD, pp. 279–285 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jain, S., O’Mahony, E., Sellmann, M. (2010). A Complete Multi-valued SAT Solver. In: Cohen, D. (eds) Principles and Practice of Constraint Programming – CP 2010. CP 2010. Lecture Notes in Computer Science, vol 6308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15396-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-15396-9_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15395-2
Online ISBN: 978-3-642-15396-9
eBook Packages: Computer ScienceComputer Science (R0)