Propagation in CSP and SAT

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.

• Type: Conference
• Year: 2006
• Where: CP
• Authors: Yannis Dimopoulos, Kostas Stergiou
• Keywords: Artificial Intelligence, Constraint Propagation, Constraint Satisfaction Problems, CP 2006, Propositional Satisfiability