constraint handling in prolog

Computing Dictionary

Constraint Handling In Prolog definition

language
(CHIP) A constraint logic programming language developed by M. Dincbas at ECRC, Munich, Germany in 1985 which includes Boolean unification and a symbolic simplex-like algorithm. CHIP introduced the domain-variable model.
["The Constraint Logic Programming Language CHIP", M. Dincbas et al, Proc 2nd Intl Conf on Fifth Generation Computer Sys, Tokyo (Nov 1988), pp.249-264].
["Constraint Satisfaction in Logic Programming", Van Hentenryck. Available from COSYTEC, 4 rue Jean Rostand, F91893 Orsay, France].
(1994-11-15)
The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source
Explore Dictionary.com
More from Thesaurus.com
Synonyms and Antonyms for Constraint Handling In Prolog
More from Reference.com
Search for articles containing Constraint Handling In Prolog
Dictionary.com Word FAQs

Dictionary.com presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014 Dictionary.com, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature