(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 collected constraiNTs it will be added to the set. If it was inconsisteNT, it will cause the engine to backtrack. CLP* is a variaNT. ["ConstraiNT Logic Programming", J. Jaffar et al, 14th POPL, ACM 1987]. (1994-11-01)