(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)

In addition suitable contents:
[ = ] [ ACM ] [ ad ] [ af ] [ ai ] [ al ] [ am ] [ an ] [ ar ] [ arc ] [ as ] [ at ] [ au ] [ b ] [ ba ] [ base ] [ be ] [ by ] [ C ] [ ca ] [ cat ] [ ch ] [ ck ] [ CL ] [ CLP ] [ CLP* ] [ CM ] [ co ] [ con ] [ cons ] [ constraint ] [ cr ] [ D ] [ dd ] [ de ] [ du ] [ ec ] [ ed ] [ ee ] [ engine ] [ er ] [ es ] [ et ] [ fi ] [ file ] [ fr ] [ frame ] [ framework ] [ gi ] [ gr ] [ h ] [ hr ] [ id ] [ il ] [ in ] [ inc ] [ incremental constraint solver ] [ inference ] [ inference engine ] [ int ] [ interpreter ] [ io ] [ is ] [ it ] [ J ] [ ke ] [ la ] [ Lex ] [ li ] [ lu ] [ lv ] [ M ] [ mm ] [ mo ] [ mod ] [ module ] [ na ] [ nc ] [ ne ] [ nf ] [ ng ] [ ni ] [ ns ] [ O ] [ ph ] [ pl ] [ POP ] [ pr ] [ program ] [ programming ] [ Prolog ] [ query ] [ rc ] [ re ] [ resolution ] [ rete ] [ ro ] [ S ] [ se ] [ set ] [ si ] [ SL ] [ so ] [ solution ] [ st ] [ T ] [ th ] [ to ] [ tr ] [ track ] [ unification ] [ US ] [ us ] [ va ] [ var ] [ ve ]