Abstract
We study the problem of encoding cardinality constraints (threshold functions) on Boolean variables into CNF. Specifically, we propose new encodings based on (perfect) hashing that are efficient in terms of the number of clauses, auxiliary variables, and propagation strength. We compare the properties of our encodings to known ones, and provide experimental results evaluating their practical effectiveness. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Ben-Haim, Y., Ivrii, A., Margalit, O., & Matsliah, A. (2012). Perfect hashing and CNF encodings of cardinality constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7317 LNCS, pp. 397–409). https://doi.org/10.1007/978-3-642-31612-8_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
