Title :
Solving 0-1 problems in CLP (PB)
Author :
Barth, Peter ; Bockmayr, Alexander
Author_Institution :
Max-Planck-Institut fuer Informatik, Saarbrucken, Germany
Abstract :
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
Keywords :
Boolean algebra; constraint handling; logic programming languages; optimisation; programming theory; 0-1 programming; AI problems; CLP (PB); constraint logic programming language; constraint solving; integer polynomials; propositional logic; pseudo-Boolean constraints; pseudo-Boolean optimization; Arithmetic; Artificial intelligence; Boolean algebra; Boolean functions; Constraint optimization; Equations; Hardware; Logic programming; Operations research; Polynomials;
Conference_Titel :
Artificial Intelligence for Applications, 1993. Proceedings., Ninth Conference on
Conference_Location :
Orlando, FL
Print_ISBN :
0-8186-3840-0
DOI :
10.1109/CAIA.1993.366601
