Abstract

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.

Keywords

Assure Prool 

Preview

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