Implementing Propagators for Tabular Constraints
Identifieur interne : 001C76 ( Main/Merge ); précédent : 001C75; suivant : 001C77Implementing Propagators for Tabular Constraints
Auteurs : Roman Barták [République tchèque] ; Roman Mecl [République tchèque]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2004.
Abstract
Abstract: Many real-life constraints describing relations between the problem variables have complex semantics. It means that the constraint domain is defined using a table of compatible tuples rather than using a formula. In the paper we study the implementation of filtering algorithms (propagators) for such constraints that we call tabular constraints. In particular, we propose compact representations of extensionally defined binary constraints and we describe filtering algorithms for them. We concentrate on the implementation aspects of these algorithms so the proposed propagators can be naturally integrated into existing constraint satisfaction packages like SICStus Prolog.
Url:
DOI: 10.1007/978-3-540-24662-6_3
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002B57
- to stream Istex, to step Curation: 002698
- to stream Istex, to step Checkpoint: 001553
Links to Exploration step
ISTEX:B36DE7E57E205AD0E63CD2331156B796B0B7C20DLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct:series"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Implementing Propagators for Tabular Constraints</title><author><name sortKey="Bartak, Roman" sort="Bartak, Roman" uniqKey="Bartak R" first="Roman" last="Barták">Roman Barták</name></author><author><name sortKey="Mecl, Roman" sort="Mecl, Roman" uniqKey="Mecl R" first="Roman" last="Mecl">Roman Mecl</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:B36DE7E57E205AD0E63CD2331156B796B0B7C20D</idno><date when="2004" year="2004">2004</date><idno type="doi">10.1007/978-3-540-24662-6_3</idno><idno type="url">https://api.istex.fr/document/B36DE7E57E205AD0E63CD2331156B796B0B7C20D/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">002B57</idno><idno type="wicri:Area/Istex/Curation">002698</idno><idno type="wicri:Area/Istex/Checkpoint">001553</idno><idno type="wicri:doubleKey">0302-9743:2004:Bartak R:implementing:propagators:for</idno><idno type="wicri:Area/Main/Merge">001C76</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Implementing Propagators for Tabular Constraints</title><author><name sortKey="Bartak, Roman" sort="Bartak, Roman" uniqKey="Bartak R" first="Roman" last="Barták">Roman Barták</name><affiliation wicri:level="1"><country xml:lang="fr">République tchèque</country><wicri:regionArea>Faculty of Mathematics and Physics, Institute for Theoretical Computer Science, Charles University in Prague, Malostranské nám. 2/25, 118 00, Praha 1</wicri:regionArea><placeName><settlement type="city">Prague</settlement><region type="région" nuts="2">Bohême centrale</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">République tchèque</country></affiliation></author><author><name sortKey="Mecl, Roman" sort="Mecl, Roman" uniqKey="Mecl R" first="Roman" last="Mecl">Roman Mecl</name><affiliation wicri:level="1"><country xml:lang="fr">République tchèque</country><wicri:regionArea>Faculty of Mathematics and Physics, Institute for Theoretical Computer Science, Charles University in Prague, Malostranské nám. 2/25, 118 00, Praha 1</wicri:regionArea><placeName><settlement type="city">Prague</settlement><region type="région" nuts="2">Bohême centrale</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">République tchèque</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2004</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno></series><idno type="istex">B36DE7E57E205AD0E63CD2331156B796B0B7C20D</idno><idno type="DOI">10.1007/978-3-540-24662-6_3</idno><idno type="ChapterID">Chap3</idno><idno type="ChapterID">3</idno></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Many real-life constraints describing relations between the problem variables have complex semantics. It means that the constraint domain is defined using a table of compatible tuples rather than using a formula. In the paper we study the implementation of filtering algorithms (propagators) for such constraints that we call tabular constraints. In particular, we propose compact representations of extensionally defined binary constraints and we describe filtering algorithms for them. We concentrate on the implementation aspects of these algorithms so the proposed propagators can be naturally integrated into existing constraint satisfaction packages like SICStus Prolog.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001C76 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 001C76 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= MozartV1
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:B36DE7E57E205AD0E63CD2331156B796B0B7C20D
|texte= Implementing Propagators for Tabular Constraints
}}
| This area was generated with Dilib version V0.6.20. |  |