The CLP language CHIP: constraint solving and applications
Pascal Van Hentenryck · 2002
A short overview of the constraint logic programming language CHIP is presented. Constraint logic programming is a class of nondeterministic languages whose main operation is constraint solving over some computation domain. Besides the Herbrand universe, CHIP contains three computation domains: Boolean algebra, linear rational arithmetics, and finite domains. CHIP has been applied to a variety of combinatorial problems in hardware design (e.g. formal verification), in operations research (e.g. car-sequencing), and in decision-support systems.>