Generalized Totalizer Encoding for Pseudo-Boolean Constraints

Conference/Journal
Springer International Publishing
Authors
Saurabh Joshi Ruben Martins Vasco Manquinho
BibTex
Abstract
Abstract Pseudo-Boolean constraints, also known as 0-1 Integer Linear Constraints, are used to model many real-world problems. A common approach to solve these constraints is to encode them into a SAT formula. The runtime of the SAT solver on such formula is sensitive to the manner in which the given pseudo-Boolean constraints are encoded. In this paper, we propose generalized Totalizer encoding (GTE), which is an arc-consistency preserving extension of the Totalizer encoding to pseudo-Boolean constraints. Unlike ...