Encoding cardinality constraints using standard encoding of generalized selection networks preserves arc-consistency

Cardinality constraints state that at most (at least, or exactly) k out of n propositional variables can be true. In this paper we prove the arc-consistency property of an encoding of cardinality constraint (into a CNF formula) that we call a standard encoding of generalized selection networks.