TY - GEN
T1 - Perfect hashing and CNF encodings of cardinality constraints
AU - Ben-Haim, Yael
AU - Ivrii, Alexander
AU - Margalit, Oded
AU - Matsliah, Arie
PY - 2012/7/30
Y1 - 2012/7/30
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84864246496&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-31612-8_30
DO - 10.1007/978-3-642-31612-8_30
M3 - Conference contribution
AN - SCOPUS:84864246496
SN - 9783642316111
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 397
EP - 409
BT - Theory and Applications of Satisfiability Testing, SAT 2012 - 15th International Conference, Proceedings
T2 - 15th International Conference on Theory and Applications of Satisfiability Testing, SAT 2012
Y2 - 17 June 2012 through 20 June 2012
ER -