Propagation in CSP and SAT
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.
KeywordsConstraint Satisfaction Problem Propositional Variable Unit Clause Propositional Theory Direct Encode
Unable to display preview. Download preview PDF.
- 1.Bacchus, F.: Enhancing Davis Putnam with Extended Binary Clause Reasoning. In: Proceedings of AAAI 2002, pp. 613–619 (2002)Google Scholar
- 2.Bennaceur, H.: The satisfiability problem regarded as a constraint satisfaction problem. In: Proceedings of ECAI 1996, pp. 125–130 (1996)Google Scholar
- 6.Freeman, J.W.: Improvements to Propositional Satisfiability Search Algorithms. Ph.D thesis (1995)Google Scholar
- 8.Freuder, E., Elfe, C.: Neighborhood Inverse Consistency Preprocessing. In: Proceedings of AAAI 1996, pp. 202–208 (1996)Google Scholar
- 9.Gent, I.: Arc Consistency in SAT. In: Proceedings of ECAI 2002, pp. 121–125 (2002)Google Scholar
- 11.Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: Proceedings of IJCAI 1997, pp. 366–371 (1997)Google Scholar
- 13.van Gelder, A., Tsuji, Y.: Satisfiability testing with more reasoning and less guessing. In: Cliques, Coloring and Satisfiability, pp. 559–586 (1996)Google Scholar