Abstract

We discuss the problem of the representation of constraints in an object-oriented programming language. We focus on a particular topic- constraint satisfaction for finite domains- and propose a class library that integrates constraints within an object-oriented language. The library is based on the systematic reification of variables, constraints, problems and algorithms. The library is implemented in Smalltalk, and is used to state and solve efficiently complex constraint problems involving Smalltalk structures. 1