论文信息 - A Translation of Pseudo Boolean Constraints to SAT

A Translation of Pseudo Boolean Constraints to SAT

This paper introduces a new CNF encoding of pseudo-Boolean constraints, which allows unit propagation to maintain generalized arc consistency. In the worst case, the size of the produced formula can be exponentially related to the size of the input constraint, but some important classes of pseudo-Boolean constraints, including Boolean cardinality constraints, are encoded in polynomial time and size. The proposed encoding was integrated in a solver based on the zCha SAT solver and submitted to the PB05 evaluation. The results provide new perspectives in the eld of full CNF approach of pseudo-Boolean constraints solving.

[1] Simon Kasif,et al. On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks , 1990, Artif. Intell..

[2] Niklas Sörensson,et al. Translating Pseudo-Boolean Constraints into SAT , 2006, J. Satisf. Boolean Model. Comput..

[3] Ian P. Gent. Arc Consistency in SAT , 2002, ECAI.

[4] P. Barth. A Davis-Putnam based enumeration algorithm for linear pseudo-Boolean optimization , 1995 .

[5] Sharad Malik,et al. Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[6] Olivier Bailleux,et al. Full CNF Encoding: The Counting Constraints Case , 2004, SAT.

[7] Olivier Bailleux,et al. Efficient CNF Encoding of Boolean Cardinality Constraints , 2003, CP.

[8] Carsten Sinz,et al. Towards an Optimal CNF Encoding of Boolean Cardinality Constraints , 2005, CP.

[9] Igor L. Markov,et al. PBS: A Backtrack-Search Pseudo-Boolean Solver and Optimizer , 2000 .