CHIP(ID:1131/chi010)


for Constraint Handling In Prolog.

M. Dincbas, ECRC Munich 1985.

Constraint logic language, includes boolean unification and a symbolic simplex-like algorithm. Constraints over integers, rationals and booleans. Symbolic constraints, cumulative constraints, and update demons. Introduced the domain-variable model.

Commercialised by COSYTEC


Related languages
METALOG => CHIP   Evolution of
CHIP => Charme   Evolution of

References:
  • Dincbas, M.; P. Van Hentenryck, H. Simonis, A. Aggoun, T. Graf, and F. Berthier. "The Constraint Logic Programming Language CHIP", Proc 2nd Intl Conf on Fifth Generation Computer Sys, Tokyo (Nov 1988), pp.249-264. view details
  • Van Hentenryck. "Constraint Satisfaction in Logic Programming" Logic Programming Series, The MIT Press, Cambridge, MA, 1989. view details
  • Cohen, Jacques "Constraint logic programming languages" CACM 33(07) July 1990 view details
  • Aggoun, A. and N. Beldiceanu. "Extending CHIP To Solve Complex Scheduling and Packing Problems" In Journ'ees Francophones De Programmation Logique, Lille, France, 1992. view details
    Resources
    • info
      i