[1-13] What is Constraint Logic Programming?


Constraint Logic Programming (CLP) augments Prolog by adding
constraints to the clauses. The CLP implementation solves goals in the
same manner as Prolog, but also merges the constraints associated with
each rule. If the merge succeeds, the successful goal and the
corresponding constraints are returned. If, however, the constraints
are mutually exclusive, the solution fails.

There is an extensive wide-ranging archive of material relating to
constraint logic programming at
   http://web.cs.city.ac.uk/archive/constraints/constraints.html

Top Document: FAQ: Prolog Resource Guide 1/2 [Monthly posting]
Previous Document: [1-12] What is the Basic Andorra Model and AKL?
Next Document: [1-14] How do you write portable programs in Prolog?

Part1 - Part2 - Single Page

[ Usenet FAQs | Web FAQs | Documents | RFC Index ]

Send corrections/additions to the FAQ Maintainer:
mkant+prg@cs.cmu.edu

Last Update October 22 2009 @ 05:33 AM