Rule-Based Constraint Programming - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Fundamenta Informaticae Year : 1998

Rule-Based Constraint Programming


In this paper we present a view of constraint programming based on the notion of rewriting controlled by strategies. We argue that this concept allows us to describe in a unified way the constraint solving mechanism as well as the meta-language needed to manipulate the constraints. This has the advantage to provide descriptions that are very close to the proof theoretical setting used now to describe constraint manipulations like unification or numerical constraint solving. We examplify the approach by presenting examples of constraint solvers descriptions and combinations written in the elan language.
Not file

Dates and versions

inria-00098476 , version 1 (25-09-2006)


  • HAL Id : inria-00098476 , version 1


Claude Kirchner, Christophe Ringeissen. Rule-Based Constraint Programming. Fundamenta Informaticae, 1998, 34 (3), pp.225--262. ⟨inria-00098476⟩
51 View
0 Download


Gmail Facebook Twitter LinkedIn More