By Letter: Non-alphabet | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z
  Email this page to a friend


Constraint Handling In Prolog




<language> (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].



< Previous Terms Terms Containing Constraint Handling In Prolog Next Terms >
Constantine/Yourdon
constant linear velocity
constant mapping
constraint
constraint functional programming
CHIP
ConstraintLisp
Constraint Logic Programming
CONSTRAINTS
constraint satisfaction
constructed type


Web Standards & Support:

Link to and support eLook.org Powered by LoadedWeb Web Hosting
Valid XHTML 1.0!Valid CSS!eLook.org FireFox Extensions