Overview

constraint logic programming


Show Summary Details

Quick Reference

(CLP)

A variation of logic programming (see logic programming languages) where constraint satisfaction is the mechanism used to perform computations rather than unification. Several programming languages have been developed for CLP.

Subjects: Computing.


Reference entries

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.