On the CNF encoding of cardinality constraints and beyond
Artificial Intelligence
2010-12-20 v1 Logic in Computer Science
Abstract
In this report, we propose a quick survey of the currently known techniques for encoding a Boolean cardinality constraint into a CNF formula, and we discuss about the relevance of these encodings. We also propose models to facilitate analysis and design of CNF encodings for Boolean constraints.
Cite
@article{arxiv.1012.3853,
title = {On the CNF encoding of cardinality constraints and beyond},
author = {Olivier Bailleux},
journal= {arXiv preprint arXiv:1012.3853},
year = {2010}
}