At the end of computation of a CLP(PB)-program we have to reformulate the set of collected constraints such that only Boolean variables that appear in the top-level goal remain. The so computed constraint set is the answer constraint of the top-level goal.
KeywordsLinear Inequality Boolean Variable Conjunctive Normal Form Disjunctive Normal Form Variable Elimination
Unable to display preview. Download preview PDF.