CLIP: A CLP(Intervals) Dialect for Metalevel Constraint Solving

  • Timothy J. Hickey
Conference paper

DOI: 10.1007/3-540-46584-7_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1753)
Cite this paper as:
Hickey T.J. (1999) CLIP: A CLP(Intervals) Dialect for Metalevel Constraint Solving. In: Pontelli E., Santos Costa V. (eds) Practical Aspects of Declarative Languages. PADL 2000. Lecture Notes in Computer Science, vol 1753. Springer, Berlin, Heidelberg

Abstract

CLIP is an implementation of CLP(Intervals) built on top of Prolog. It has been developed using the simplest model of constraint solving in which constraints are decomposed into sets of primitive constraints and a simple constraint queue is used to repeatedly apply primitive constraint contractions until some termination condition applies (e.g. no signicant change occurs, or a preset limit on the number of contractions is reached). The simple semantics and implementation make it relatively straightforward to prove that the system is sound. In this paper we show how to implement more complex constraint solvers in CLIP. In particu- lar, we demonstrate that several of the box-narrowing algorithms from the Newton and Numerica systems can be easily implemented in CLIP. The principal advantages of this approach are (1) the resulting solvers are relatively easy to prove correct, (2) new solvers can be rapidly prototyped since the code is more concise and declarative than for imperative languages, and (3) contractors can be implemented directly from mathematical formulae without having to first prove results about interval arithmetic operators.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Timothy J. Hickey
    • 1
  1. 1.Michtom School of Computer ScienceBrandeis UniversityUSA

Personalised recommendations