Applications using CHIP are listed here.
CHIP (Constraint Handling in Prolog) is a Prolog based constraint system developed at ECRC (European Computer Industry Research Centre) in Munich. Its main features were a pioneering finite domain constraint solver, combined with a complete solver over linear constraints over rational numbers and a complete Boolean solver based on Boolean unification. The best overview of the CHIP system is in Mehmet Dincbas, Pascal Van Hentenryck, Helmut Simonis, Abderrahmane Aggoun, Thomas Graf, Françoise Berthier: The Constraint Logic Programming Language CHIP. FGCS 1988: 693-702. A description of the initial finite domain solver in CHIP can be found in P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, Boston, MA, 1989.
In 1990, many of the members of the original CHIP team left ECRC and started COSYTEC in Orsay, France, to commercialize the CHIP system and develop applications using the tool. Continued development led to the introduction of a number of global constraints, which made large-scale applications with finite domain constraints an industrial reality. Two key references on global constraints in CHIP are A. Aggoun, N. Beldiceanu. Extending CHIP in Order to Solve Complex Scheduling Problems. Journal of Mathematical and Computer Modelling, Vol. 17, No. 7, pages 57-73 Pergamon Press, 1993. and N. Beldiceanu, E. Contejean. Introducing Global Constraints in CHIP. Journal of Mathematical and Computer Modelling, Vol. 20, No. 12, pp 97-123, 1994.
In 2010, COSYTEC is still active and selling solutions in focused domains for personnel management and warehouse management.
I was working at ECRC from 1986 to 1990 (my first job after university), and I was working as technical director of COSYTEC from 1990 to 2000.