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

Style="border-width:thin; border-color:#333333; border-Style:daShed; padding:5px;" align="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 ]