Solex: a Domain-Independent Scheme for Constraint Solver Extension - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 1998

Solex: a Domain-Independent Scheme for Constraint Solver Extension

Abstract

In declarative programming languages based on the constraint programming paradigm, computations can be viewed as deductions and are enhanced with the use of constraint solvers. However, admissible constraints are restricted to formulae handled by solvers and thus, declarativity may be jeopardized. We present a domain-independent scheme for extending constraint solvers with new function symbols. This mechanism, called Solex, consists of a collaboration of elementary solvers. They add and deduce information related to constraints involving new functions, complete the computation domain and purify constraints. Some extensions of computation domains have already been studied to demonstrate the broad scope of Solex potential applications.
No file

Dates and versions

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

Identifiers

  • HAL Id : inria-00098506 , version 1

Cite

Eric Monfroy, Christophe Ringeissen. Solex: a Domain-Independent Scheme for Constraint Solver Extension. International Conference on Artificial Intelligence & Symbolic Computation - AISC'98, 1998, Plattsburgh, New York, USA, pp.222--233. ⟨inria-00098506⟩
75 View
0 Download

Share

Gmail Facebook X LinkedIn More