Domain-Independent Constraint Solver Extension
Identifieur interne : 00C685 ( Main/Merge ); précédent : 00C684; suivant : 00C686Domain-Independent Constraint Solver Extension
Auteurs : E. Monfroy ; Christophe RingeissenSource :
English descriptors
- KwdEn :
Abstract
Constraint Logic Programming (CLP) is a class of programming languages inheriting declarativity from logic programming and efficiency from constraint solving. The CLP scheme enables to design applications by declaring relations (the constraints) between high-level objects. However, constraints are restricted to formulae handled by solvers. Thus, the declarativity may be jeopardized due to the scope of solvers. SoleX is a mechanism for extending constraint solvers in order to handle new function symbols on the computation domain. This extension consists in building two kinds of rule-based transformations : domain independent rules for symbolically processing constraints with additional function symbols and rules for completing the information on the domain with the usual interpretation of these additional functions. Some extensions of computation domains have already been solved in order to demonstrate the broad scope of SoleX potential applications.
Links toward previous steps (curation, corpus...)
- to stream Crin, to step Corpus: 001C20
- to stream Crin, to step Curation: 001C20
- to stream Crin, to step Checkpoint: 002926
Links to Exploration step
CRIN:monfroy96bLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="337">Domain-Independent Constraint Solver Extension</title></titleStmt><publicationStmt><idno type="RBID">CRIN:monfroy96b</idno><date when="1996" year="1996">1996</date><idno type="wicri:Area/Crin/Corpus">001C20</idno><idno type="wicri:Area/Crin/Curation">001C20</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">001C20</idno><idno type="wicri:Area/Crin/Checkpoint">002926</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">002926</idno><idno type="wicri:Area/Main/Merge">00C685</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Domain-Independent Constraint Solver Extension</title><author><name sortKey="Monfroy, E" sort="Monfroy, E" uniqKey="Monfroy E" first="E." last="Monfroy">E. Monfroy</name></author><author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name></author></analytic></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>combination problem</term><term>constraint logic programming</term><term>extension of solver</term><term>rule-based algorithm</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="4500">Constraint Logic Programming (CLP) is a class of programming languages inheriting declarativity from logic programming and efficiency from constraint solving. The CLP scheme enables to design applications by declaring relations (the constraints) between high-level objects. However, constraints are restricted to formulae handled by solvers. Thus, the declarativity may be jeopardized due to the scope of solvers. SoleX is a mechanism for extending constraint solvers in order to handle new function symbols on the computation domain. This extension consists in building two kinds of rule-based transformations : domain independent rules for symbolically processing constraints with additional function symbols and rules for completing the information on the domain with the usual interpretation of these additional functions. Some extensions of computation domains have already been solved in order to demonstrate the broad scope of SoleX potential applications.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00C685 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 00C685 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Merge
|type= RBID
|clé= CRIN:monfroy96b
|texte= Domain-Independent Constraint Solver Extension
}}
| This area was generated with Dilib version V0.6.33. |  |