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

N="left">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 ]