CONSTRAINT LOGIC PROGRAMMING
\kənstɹˈe͡ɪnt lˈɒd͡ʒɪk pɹˈə͡ʊɡɹamɪŋ], \kənstɹˈeɪnt lˈɒdʒɪk pɹˈəʊɡɹamɪŋ], \k_ə_n_s_t_ɹ_ˈeɪ_n_t l_ˈɒ_dʒ_ɪ_k p_ɹ_ˈəʊ_ɡ_ɹ_a_m_ɪ_ŋ]\
Sort: Oldest first
-
(CLP) A programming framework based (like Prolog) on LUSH(or SLD) resolution, but in which unification has beenreplaced by a constraint solver. A CLP interpretercontains a Prolog-like inference engine and an incrementalconstraint solver. The engine sends constraints to thesolver one at a time. If the new constraint is consistentwith the collected constraints it will be added to the set.If it was inconsistent, it will cause the engine tobacktrack.CLP* is a variant.["Constraint Logic Programming", J. Jaffar et al, 14th POPL,ACM 1987].
By Denis Howe
Word of the day
basidiomycota
- comprises fungi bearing the spores on basidium: Gasteromycetes (puffballs); Tiliomycetes (comprising orders Ustilaginales (smuts) and Uredinales (rusts)); Hymenomycetes (mushrooms; toadstools; agarics; bracket fungi); in some classification systems considered a division of kingdom comprises fungi bearing spores on a basidium; includes Gasteromycetes (puffballs) Tiliomycetes comprising the orders Ustilaginales (smuts) and Uredinales (rusts) Hymenomycetes (mushrooms, toadstools, agarics bracket fungi).