This introduction to the Constraint Logic Programming language CLP(R)
uses applications to provide insight to the language's strengths. An o
verview of CLP(R) is followed by a discussion of three applications th
at illustrate the language's unifying treatment both of numeric and sy
mbolic computing and of engineering analysis and synthesis problems. A
nother discussion dissects the interpreter's constraint solver and cla
rifies how a problem's search space can be restricted declaratively. T
he final example is an extended description of the construction of a n
etwork of interpreters, which can be used to distributively solve a se
t of linear equations. This extension requires no modification of the
CLP(R) interpreter and points out the benefits of revisiting establish
ed algorithms vis-a-vis CLP(R).