2001/05/07 by Frederic Goualard, Goualard, Frederic
Computer Science · #D.2 #D.3.3 #FOS: Computer and information sciences #Programming Languages (cs.PL) #cs.PL
paper · pdf · doi:10.48550/arxiv.cs/0105011
11 pages, 1 figure, paper accepted at the 6th Annual workshop of the ERCIM Working Group on Constraints
arxiv created 2001/05/07 · arxiv updated 2009/11/30
Prolog was once the main host for implementing constraint solvers. It seems that it is no longer so. To be useful, constraint solvers have to be integrable into industrial applications written in imperative or object-oriented languages; to be efficient, they have to interact with other solvers. To meet these requirements, many solvers are now implemented in the form of extensible object-oriented libraries. Following Pfister and Szyperski, we argue that ``objects are not enough,'' and we propose to design solvers as component-oriented libraries. We illustrate our approach by the description of the architecture of a prototype, and we assess its strong points and weaknesses.