Towards an Optimal CNF Encoding of Boolean Cardinality Constraints

@inproceedings{Sinz2005TowardsAO,
  title={Towards an Optimal CNF Encoding of Boolean Cardinality Constraints},
  author={Carsten Sinz},
  booktitle={CP},
  year={2005}
}
We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at least) k out of n propositional variables or formulae are true. We present a unifying framework for a whole family of such encodings encompassing previously proposed solutions. We give two novel encodings that improve upon existing results, one which requires only 7n clauses and 2n additional variables, and another… CONTINUE READING
Highly Influential
This paper has highly influenced 30 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 404 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 217 extracted citations

405 Citations

02040'08'11'14'17
Citations per Year
Semantic Scholar estimates that this publication has 405 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 14 references