CLP
CLP essentially merges logic programming with constraint solving
Constraint solving is much in the spirit of logic programming, allowing a two-way flow of computation
- But the domains are not limited to relations
- Borning’s Thinglab is a classic example of a system based on constraint solving
- “here’s a polygon in which I always want the opposite sides to be parallel to each other.”
- “keep point M as the midpoint of the line defined by points A and B.”