HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

An Open Automated Framework for Constraint Solver Extension: the SoleX Approach

Eric Monfroy 1 Christophe Ringeissen 2
2 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In declarative programming languages based on the constraint programming paradigm, computations can be viewed as deductions enhanced with the use of constraint solvers. However, admissible constraints are restricted to formulae handled by solvers and thus, declarativity may be jeopardized. We propose a domain-independent scheme to extend constraint solvers so that they can handle alien constraints, i.e., constraint involving new function symbols. This mechanism, called Solex, consists of a set of symbolic rule-based transformations: they add and deduce syntactical as well as semantic information related to alien constraints, complete the computation domain, and purify constraints in order to allow solvers to cope with alien constraints. These transformations can be seen as elementary solvers, and thus, Solex is a collaboration of these several solvers with the initial solver. Some extensions of computation domains have already been studied to demonstrate the broad scope of Solex potential applications.
Document type :
Journal articles
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 8:38:46 AM
Last modification on : Friday, February 4, 2022 - 3:30:05 AM


  • HAL Id : inria-00098809, version 1



Eric Monfroy, Christophe Ringeissen. An Open Automated Framework for Constraint Solver Extension: the SoleX Approach. Fundamenta Informaticae, Polskie Towarzystwo Matematyczne, 1999, 39 (1-2), pp.167--187. ⟨inria-00098809⟩



Record views