(CHIP) A constraint logic programming language developed by M. Dincbas at ECRC, Munich, Germany in 1985 which includes Boolean unification and a symbolic simplex-like algorithm. CHIP introduced the domain-variable model.
[“The Constraint Logic Programming Language CHIP”, M. Dincbas et al, Proc 2nd Intl Conf on Fifth Generation Computer Sys, Tokyo (Nov 1988), pp.249-264].
[“Constraint Satisfaction in Logic Programming”, Van Hentenryck. Available from COSYTEC, 4 rue Jean Rostand, F91893 Orsay, France].
language An object-oriented constraint language based on CSP. An extension of Common Lisp and CLOS. [“ConstraintLisp: An Object-Oriented Constraint Programming Language”, Bing Liu (ex email@example.com) et al, SIGPLAN Notices 27(11):17-26, Nov 1992]. (2000-04-02)
- Constraint logic programming
(CLP) A programming framework based (like Prolog) on LUSH (or SLD) resolution, but in which unification has been replaced by a constraint solver. A CLP interpreter contains a Prolog-like inference engine and an incremental constraint solver. The engine sends constraints to the solver one at a time. If the new constraint is consistent with the […]
[kuh n-streynt] /kənˈstreɪnt/ noun 1. limitation or restriction. 2. repression of natural feelings and impulses: to practice constraint. 3. unnatural restraint in manner, conversation, etc.; embarrassment. 4. something that . 5. the act of . 6. the condition of being . 7. Linguistics. a restriction on the operation of a linguistic rule or the occurrence […]
- Constraint satisfaction
application The process of assigning values to variables while meeting certain requirements or “constraints”. For example, in graph colouring, a node is a variable, the colour assigned to it is its value and a link between two nodes represents the constraint that those two nodes must not be assigned the same colour. In scheduling, constraints […]