BoolVar/Pb is a Java library for translating pseudo-Boolean constraints into CNF formulae. Pseudo-Boolean constraints are linear inequations with integer coefficients and 0/1 variables. They can be used for modelling a number of problems in the area of time-table design, planning, resource allocation, circuit diagnosis... The resulting CNF formula is satisfiable if and only if the input problem admits a solution. BoolVar/PB allows problems that are specified with pseudo-Boolean constraints to be solved using SAT solvers.