Copyright © Philip M. Parker, INSEAD. Terms of Use.

CONSTRAINT HANDLING IN PROLOG

Specialty Definition: CONSTRAINT HANDLING IN PROLOG

DomainDefinition

Computing

Constraint Handling In Prolog (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). Source: The Free On-line Dictionary of Computing.

Source: compiled by the editor from various references; see credits.

Top     


Alternative Orthography: CONSTRAINT HANDLING IN PROLOG


Hexadecimal (or equivalents, 770AD-1900s) (references)

43 4F 4E 53 54 52 41 49 4E 54      48 41 4E 44 4C 49 4E 47      49 4E      50 52 4F 4C 4F 47

Leonardo da Vinci (1452-1519; backwards) (references)

            

Binary Code (1918-1938, probably earlier) (references)

01000011 01001111 01001110 01010011 01010100 01010010 01000001 01001001 01001110 01010100 00100000 01001000 01000001 01001110 01000100 01001100 01001001 01001110 01000111 00100000 01001001 01001110 00100000 01010000 01010010 01001111 01001100 01001111 01000111

HTML Code (1990) (references)

&#67 &#79 &#78 &#83 &#84 &#82 &#65 &#73 &#78 &#84 &#32 &#72 &#65 &#78 &#68 &#76 &#73 &#78 &#71 &#32 &#73 &#78 &#32 &#80 &#82 &#79 &#76 &#79 &#71

ISO 10646 (1991-1993) (references)

0043 004F 004E 0053 0054 0052 0041 0049 004E 0054      0048 0041 004E 0044 004C 0049 004E 0047      0049 004E      0050 0052 004F 004C 004F 0047

Encryption (beginner's substitution cypher): (references)

3749485354523543485424235483846434841243482505249464941

Top     



INDEX

1. Orthography
2. Bibliography


  

Copyright © Philip M. Parker, INSEAD. Terms of Use.