Constraint Reductions

Abstract

This is a commentary on the CP 2003 paper "Efficient cnf encoding of boolean cardinality constraints". After recalling its context, we outline a classification of Constraints with respect to their deductive power regarding General Arc Consistency (GAC).

References in corpus (2)

• Circuit Complexity and Decompositions of Global Constraints
• A framework for good SAT translations, with applications to CNF representations of XOR constraints