Rule-Based Constraint Programming
Identifieur interne : 002379 ( Crin/Checkpoint ); précédent : 002378; suivant : 002380Rule-Based Constraint Programming
Auteurs : Claude Kirchner ; Christophe RingeissenSource :
- Fundamenta Informaticae ; 1998.
English descriptors
- KwdEn :
Abstract
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.
Links toward previous steps (curation, corpus...)
Links to Exploration step
CRIN:kirchner98dLe document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" wicri:score="211">Rule-Based Constraint Programming</title></titleStmt><publicationStmt><idno type="RBID">CRIN:kirchner98d</idno><date when="1998" year="1998">1998</date><idno type="wicri:Area/Crin/Corpus">002324</idno><idno type="wicri:Area/Crin/Curation">002324</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Curation">002324</idno><idno type="wicri:Area/Crin/Checkpoint">002379</idno><idno type="wicri:explorRef" wicri:stream="Crin" wicri:step="Checkpoint">002379</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en">Rule-Based Constraint Programming</title><author><name sortKey="Kirchner, Claude" sort="Kirchner, Claude" uniqKey="Kirchner C" first="Claude" last="Kirchner">Claude Kirchner</name></author><author><name sortKey="Ringeissen, Christophe" sort="Ringeissen, Christophe" uniqKey="Ringeissen C" first="Christophe" last="Ringeissen">Christophe Ringeissen</name></author></analytic><series><title level="j">Fundamenta Informaticae</title><imprint><date when="1998" type="published">1998</date></imprint></series></biblStruct></sourceDesc></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>computational systems</term><term>constraint programming</term><term>constraint solving</term><term>rewriting logic</term><term>unification</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en" wicri:score="2919">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.</div></front></TEI><BibTex type="article"><ref>kirchner98d</ref><crinnumber>98-R-265</crinnumber><category>1</category><equipe>PROTHEO</equipe><author><e>Kirchner, Claude</e><e>Ringeissen, Christophe</e></author><title>Rule-Based Constraint Programming</title><journal>Fundamenta Informaticae</journal><year>1998</year><volume>34</volume><number>3</number><pages>225--262</pages><month>Jun</month><keywords><e>constraint programming</e><e>constraint solving</e><e>unification</e><e>rewriting logic</e><e>computational systems</e></keywords><abstract>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.</abstract></BibTex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Crin/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002379 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Crin/Checkpoint/biblio.hfd -nk 002379 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Crin
|étape= Checkpoint
|type= RBID
|clé= CRIN:kirchner98d
|texte= Rule-Based Constraint Programming
}}
| This area was generated with Dilib version V0.6.33. |  |