Abstract
Constraint Satisfaction Problems and Propositional Satisfiability, are frameworks widely used to represent and solve combinatorial problems. A concept of primary importance in both frameworks is that of constraint propagation. In this paper we study and compare the amount of propagation that can be achieved, using various methods, when translating a problem from one framework into another. Our results complement, extend, and tie together recent similar studies. We provide insight as to which translation is preferable, with respect to the strength of propagation in the original problem and the encodings.
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
Bacchus, F.: Enhancing Davis Putnam with Extended Binary Clause Reasoning. In: Proceedings of AAAI 2002, pp. 613–619 (2002)
Bennaceur, H.: The satisfiability problem regarded as a constraint satisfaction problem. In: Proceedings of ECAI 1996, pp. 125–130 (1996)
Bennaceur, H.: A Comparison between SAT and CSP Techniques. Constraints 9, 123–138 (2004)
Bessière, C., Hebrard, E., Walsh, T.: Local consistencies in SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 299–314. Springer, Heidelberg (2004)
Debruyne, R., Bessière, C.: Domain Filtering Consistencies. Journal of Artificial Intelligence Research 14, 205–230 (2001)
Freeman, J.W.: Improvements to Propositional Satisfiability Search Algorithms. Ph.D thesis (1995)
Freuder, E.: A Sufficient Condition for Backtrack-bounded Search. JACM 32(4), 755–761 (1985)
Freuder, E., Elfe, C.: Neighborhood Inverse Consistency Preprocessing. In: Proceedings of AAAI 1996, pp. 202–208 (1996)
Gent, I.: Arc Consistency in SAT. In: Proceedings of ECAI 2002, pp. 121–125 (2002)
Kasif, S.: On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks. Artificial Intelligence 45(3), 275–286 (1990)
Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: Proceedings of IJCAI 1997, pp. 366–371 (1997)
Prestwich, S.D.: Full dynamic substitutability by SAT encoding. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 512–526. Springer, Heidelberg (2004)
van Gelder, A., Tsuji, Y.: Satisfiability testing with more reasoning and less guessing. In: Cliques, Coloring and Satisfiability, pp. 559–586 (1996)
Walsh, T.: SAT v CSP. In: Dechter, R. (ed.) CP 2000. LNCS, vol. 1894, pp. 441–456. Springer, Heidelberg (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dimopoulos, Y., Stergiou, K. (2006). Propagation in CSP and SAT. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_12
Download citation
DOI: https://doi.org/10.1007/11889205_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)