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).
Cite
@article{arxiv.2006.02081,
title = {Constraint Reductions},
author = {Olivier Bailleux and Yacine Boufkhad},
journal= {arXiv preprint arXiv:2006.02081},
year = {2020}
}