Solex: a Domain-Independent Scheme for Constraint Solver Extension

Eric Monfroy 1 Christophe Ringeissen 1
1 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 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.
Type de document :
Communication dans un congrès
Jacques Calmet & Jan Plaza. International Conference on Artificial Intelligence & Symbolic Computation - AISC'98, 1998, Plattsburgh, New York, USA, Springer-Verlag, 1476, pp.222--233, 1998, Lecture Notes in Artificial Intelligence
Liste complète des métadonnées

https://hal.inria.fr/inria-00098506
Contributeur : Publications Loria <>
Soumis le : lundi 25 septembre 2006 - 17:02:40
Dernière modification le : jeudi 11 janvier 2018 - 06:19:58

Identifiants

  • HAL Id : inria-00098506, version 1

Collections

Citation

Eric Monfroy, Christophe Ringeissen. Solex: a Domain-Independent Scheme for Constraint Solver Extension. Jacques Calmet & Jan Plaza. International Conference on Artificial Intelligence & Symbolic Computation - AISC'98, 1998, Plattsburgh, New York, USA, Springer-Verlag, 1476, pp.222--233, 1998, Lecture Notes in Artificial Intelligence. 〈inria-00098506〉

Partager

Métriques

Consultations de la notice

113