Page
%P
-
Chapter and Conference Paper
Perfect Hashing and CNF Encodings of Cardinality Constraints
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 th...
-
Chapter and Conference Paper
On Efficient Computation of Variable MUSes
In this paper we address the following problem: given an unsatisfiable CNF formula \({\mathcal{F}}\) , find a minimal su...