Linear 0-1 Inequalities and Extended Clauses
Peter M. Barth · 1994
0-1 constraint satisfaction problems have been investigated for a long time. The idea to instantiate the computational domain χ in the CLP( χ ) scheme [JL87] with 0-1 or pseudo-Boolean constraints was first introduced in [Boc92]. The resulting language CLP( PB ) aims to be a logic programming environment suitable for various applications where 0-1 problems naturally arise. This is the case for many AI-applications [BB93] and operations research. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.