Full CNF Encoding: The Counting Constraints Case

Abstract. Many problems are naturally expressed using CNF clauses and boolean cardinality constraints. It is generally believed that solving such problems through pure CNF encoding is inefficient, so many authors has proposed specialized algorithms : the pseudo-boolean solvers. In this paper we show that an appropriate pure CNF encoding can be competitive with these specialized methods. In conjunction with our encoding, we propose a slight modification of the DLL procedure that allows any DLL-based SAT solver to solve boolean cardinality optimization problems. We show experimentally that our encoding allows zchaff to be competitive with pseudo-boolean solvers on some decision and optimization problems.

• Type: Conference
• Year: 2004
• Where: SAT
• Authors: Olivier Bailleux, Yacine Boufkhad
• Keywords: Boolean Cardinality, Boolean Cardinality Constraints, Pseudo-boolean Solvers, SAT 2004