New Encodings of Pseudo-Boolean Constraints into CNF - Université de Bourgogne Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

New Encodings of Pseudo-Boolean Constraints into CNF

Résumé

This paper answers affirmatively the open question of the existence of a polynomial size CNF encoding of pseudo-Boolean (PB) constraints such that generalized arc consistency (GAC) is maintained through unit propagation (UP). All previous encodings of PB constraints either did not allow UP to maintain GAC, or were of exponential size in the worst case. This paper presents an encoding that realizes both of the desired properties. From a theoretical point of view, this narrows the gap between the expressive power of clauses and the one of pseudo-Boolean constraints.
Fichier non déposé

Dates et versions

hal-00415126 , version 1 (10-09-2009)

Identifiants

  • HAL Id : hal-00415126 , version 1

Citer

Olivier Bailleux, Yacine Boufkhad, Olivier Roussel. New Encodings of Pseudo-Boolean Constraints into CNF. Theory and Applications of Satisfiability Testing - SAT 2009, Jun 2009, Swansea, United Kingdom. pp.181-194. ⟨hal-00415126⟩
206 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More