Title :
The CLP language CHIP: constraint solving and applications
Author :
Van Hentenryck, P.
Author_Institution :
Brown Univ., Providence, RI, USA
fDate :
Feb. 25 1991-March 1 1991
Abstract :
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.<>
Keywords :
Boolean algebra; logic programming; programming languages; Boolean algebra; CLP language CHIP; Herbrand universe; car-sequencing; constraint logic programming language; constraint solving; decision-support systems; finite domains; formal verification; linear rational arithmetics; nondeterministic languages; operations research; overview; Arithmetic; Boolean algebra; Formal verification; Hardware; Logic functions; Logic programming; Operations research;
Conference_Titel :
Compcon Spring '91. Digest of Papers
Conference_Location :
San Francisco, CA, USA
Print_ISBN :
0-8186-2134-6
DOI :
10.1109/CMPCON.1991.128838
