Encoding Cardinality Constraints using Generalized Selection Networks

Michał Karpiński, Marek Piotrów

Boolean cardinality constraints state that at most (at least, or exactly) $k$ out of $n$ propositional literals can be true. We propose a new class of selection networks that can b…