Solving 0-1 problems in CLP (PB)

摘要

The authors present the constraint logic programming language CLP(PB) which provides efficient 0-1 constraint solving within the logic programming paradigm. It is well suited for implementing various typical AI problems. CLP(PB) supports pseudo-Boolean constraints, that is equations and inequalities between integer polynomials in 0-1 variables, and pseudo-Boolean optimization, also known as 0-1 programming. The advantage of pseudo-Boolean formulations versus equivalent ones in propositional logic is illustrated with an example. Constraint programming in CLP(PB) and the implementation of algorithms interacting with the current constraint set are discussed.