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.


Linear Inequality Boolean Variable Conjunctive Normal Form Disjunctive Normal Form Variable Elimination 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1996

Authors and Affiliations

  • Peter Barth
    • 1
  1. 1.Max Planck InstituteSaarbrückenGermany

Personalised recommendations