Perfect Hashing and CNF Encodings of Cardinality Constraints
From MaRDI portal
Publication:2843343
DOI10.1007/978-3-642-31612-8_30zbMath1273.68315OpenAlexW1794367353MaRDI QIDQ2843343
Alexander Ivrii, Olded Margalit, Yael Ben-Haim, Arie Matsliah
Publication date: 12 August 2013
Published in: Theory and Applications of Satisfiability Testing – SAT 2012 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31612-8_30
Analysis of algorithms and problem complexity (68Q25) Mechanization of proofs and logical operations (03B35)
Related Items (3)
Rewriting optimization statements in answer-set programs ⋮ A lower bound on CNF encodings of the at-most-one constraint ⋮ meSAT: multiple encodings of CSP to SAT
This page was built for publication: Perfect Hashing and CNF Encodings of Cardinality Constraints
