Implementing Semiring-Based Constraints Using Mozart
Identifieur interne : 000024 ( Istex/Corpus ); précédent : 000023; suivant : 000025Implementing Semiring-Based Constraints Using Mozart
Auteurs : Alberto Delgado ; Alberto Olarte ; Andrés Pérez ; Camilo RuedaSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2005.
Abstract
Abstract: Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and preferences is still a matter for research. Several formal frameworks for soft constraints have been proposed within the CP community: all of them seem to be theoretically solid, but few practical implementations exist. In this paper we present an implementation for Mozart of one of these frameworks, which is based on a semiring structure. We explain how the soft constraints constructs were adapted to the propagation process that Mozart performs, and show how they can be transparently integrated with current Mozart hard propagators. Additionally, we show how over-constrained problems can be successfully relaxed and solved, and how preferences can be added to a problem, while keeping the formal model as a direct reference.
Url:
DOI: 10.1007/978-3-540-31845-3_19
Links to Exploration step
ISTEX:7CD2E4CB89989028AD9DCB215FE8B1480BC441C4Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Implementing Semiring-Based Constraints Using Mozart</title><author><name sortKey="Delgado, Alberto" sort="Delgado, Alberto" uniqKey="Delgado A" first="Alberto" last="Delgado">Alberto Delgado</name><affiliation><mods:affiliation>Pontificia Universidad Javeriana, Cali</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: albertod@puj.edu.co</mods:affiliation></affiliation></author><author><name sortKey="Olarte, Alberto" sort="Olarte, Alberto" uniqKey="Olarte A" first="Alberto" last="Olarte">Alberto Olarte</name><affiliation><mods:affiliation>Pontificia Universidad Javeriana, Cali</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: caolarte@atlas.puj.edu.co</mods:affiliation></affiliation></author><author><name sortKey="Perez, Andres" sort="Perez, Andres" uniqKey="Perez A" first="Andrés" last="Pérez">Andrés Pérez</name><affiliation><mods:affiliation>Pontificia Universidad Javeriana, Cali</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: japerezp@puj.edu.co</mods:affiliation></affiliation></author><author><name sortKey="Rueda, Camilo" sort="Rueda, Camilo" uniqKey="Rueda C" first="Camilo" last="Rueda">Camilo Rueda</name><affiliation><mods:affiliation>Pontificia Universidad Javeriana, Cali</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: crueda@atlas.puj.edu.co</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:7CD2E4CB89989028AD9DCB215FE8B1480BC441C4</idno><date when="2005" year="2005">2005</date><idno type="doi">10.1007/978-3-540-31845-3_19</idno><idno type="url">https://api.istex.fr/document/7CD2E4CB89989028AD9DCB215FE8B1480BC441C4/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000024</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Implementing Semiring-Based Constraints Using Mozart</title><author><name sortKey="Delgado, Alberto" sort="Delgado, Alberto" uniqKey="Delgado A" first="Alberto" last="Delgado">Alberto Delgado</name><affiliation><mods:affiliation>Pontificia Universidad Javeriana, Cali</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: albertod@puj.edu.co</mods:affiliation></affiliation></author><author><name sortKey="Olarte, Alberto" sort="Olarte, Alberto" uniqKey="Olarte A" first="Alberto" last="Olarte">Alberto Olarte</name><affiliation><mods:affiliation>Pontificia Universidad Javeriana, Cali</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: caolarte@atlas.puj.edu.co</mods:affiliation></affiliation></author><author><name sortKey="Perez, Andres" sort="Perez, Andres" uniqKey="Perez A" first="Andrés" last="Pérez">Andrés Pérez</name><affiliation><mods:affiliation>Pontificia Universidad Javeriana, Cali</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: japerezp@puj.edu.co</mods:affiliation></affiliation></author><author><name sortKey="Rueda, Camilo" sort="Rueda, Camilo" uniqKey="Rueda C" first="Camilo" last="Rueda">Camilo Rueda</name><affiliation><mods:affiliation>Pontificia Universidad Javeriana, Cali</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: crueda@atlas.puj.edu.co</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2005</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno></series><idno type="istex">7CD2E4CB89989028AD9DCB215FE8B1480BC441C4</idno><idno type="DOI">10.1007/978-3-540-31845-3_19</idno><idno type="ChapterID">Chap19</idno><idno type="ChapterID">19</idno></biblStruct></sourceDesc></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and preferences is still a matter for research. Several formal frameworks for soft constraints have been proposed within the CP community: all of them seem to be theoretically solid, but few practical implementations exist. In this paper we present an implementation for Mozart of one of these frameworks, which is based on a semiring structure. We explain how the soft constraints constructs were adapted to the propagation process that Mozart performs, and show how they can be transparently integrated with current Mozart hard propagators. Additionally, we show how over-constrained problems can be successfully relaxed and solved, and how preferences can be added to a problem, while keeping the formal model as a direct reference.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Alberto Delgado</name><affiliations><json:string>Pontificia Universidad Javeriana, Cali</json:string><json:string>E-mail: albertod@puj.edu.co</json:string></affiliations></json:item><json:item><name>Carlos Alberto Olarte</name><affiliations><json:string>Pontificia Universidad Javeriana, Cali</json:string><json:string>E-mail: caolarte@atlas.puj.edu.co</json:string></affiliations></json:item><json:item><name>Jorge Andrés Pérez</name><affiliations><json:string>Pontificia Universidad Javeriana, Cali</json:string><json:string>E-mail: japerezp@puj.edu.co</json:string></affiliations></json:item><json:item><name>Camilo Rueda</name><affiliations><json:string>Pontificia Universidad Javeriana, Cali</json:string><json:string>E-mail: crueda@atlas.puj.edu.co</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><abstract>Abstract: Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and preferences is still a matter for research. Several formal frameworks for soft constraints have been proposed within the CP community: all of them seem to be theoretically solid, but few practical implementations exist. In this paper we present an implementation for Mozart of one of these frameworks, which is based on a semiring structure. We explain how the soft constraints constructs were adapted to the propagation process that Mozart performs, and show how they can be transparently integrated with current Mozart hard propagators. Additionally, we show how over-constrained problems can be successfully relaxed and solved, and how preferences can be added to a problem, while keeping the formal model as a direct reference.</abstract><qualityIndicators><score>6.632</score><pdfVersion>1.3</pdfVersion><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>903</abstractCharCount><pdfWordCount>5218</pdfWordCount><pdfCharCount>29940</pdfCharCount><pdfPageCount>13</pdfPageCount><abstractWordCount>136</abstractWordCount></qualityIndicators><title>Implementing Semiring-Based Constraints Using Mozart</title><genre><json:string>Book Chapter</json:string></genre><serie><editor><json:item><name>David Hutchison</name><affiliations><json:string>Lancaster University, UK</json:string></affiliations></json:item><json:item><name>Takeo Kanade</name><affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string></affiliations></json:item><json:item><name>Josef Kittler</name><affiliations><json:string>University of Surrey, Guildford, UK</json:string></affiliations></json:item><json:item><name>Jon M. Kleinberg</name><affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string></affiliations></json:item><json:item><name>Friedemann Mattern</name><affiliations><json:string>ETH Zurich, Switzerland</json:string></affiliations></json:item><json:item><name>John C. Mitchell</name><affiliations><json:string>Stanford University, CA, USA</json:string></affiliations></json:item><json:item><name>Moni Naor</name><affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string></affiliations></json:item><json:item><name>Oscar Nierstrasz</name><affiliations><json:string>University of Bern, Switzerland</json:string></affiliations></json:item><json:item><name>C. Pandu Rangan</name><affiliations><json:string>Indian Institute of Technology, Madras, India</json:string></affiliations></json:item><json:item><name>Bernhard Steffen</name><affiliations><json:string>University of Dortmund, Germany</json:string></affiliations></json:item><json:item><name>Madhu Sudan</name><affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string></affiliations></json:item><json:item><name>Demetri Terzopoulos</name><affiliations><json:string>New York University, NY, USA</json:string></affiliations></json:item><json:item><name>Dough Tygar</name><affiliations><json:string>University of California, Berkeley, CA, USA</json:string></affiliations></json:item><json:item><name>Moshe Y. Vardi</name><affiliations><json:string>Rice University, Houston, TX, USA</json:string></affiliations></json:item><json:item><name>Gerhard Weikum</name><affiliations><json:string>Max-Planck Institute of Computer Science, Saarbruecken, Germany</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><genre><json:string>book series</json:string></genre><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2005</copyrightDate></serie><host><volume>3389</volume><editor><json:item><name>Peter Van Roy</name><affiliations><json:string>Department of Computing Science and Engineering, Université catholique de Louvain, Place Sainte Barbe, 2, B-1348, Louvain-la-Neuve, Belgium</json:string><json:string>E-mail: pvr@info.ucl.ac.be</json:string></affiliations></json:item></editor><pages><last>236</last><first>224</first></pages><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Programming Languages, Compilers, Interpreters</value></json:item><json:item><value>Logics and Meanings of Programs</value></json:item><json:item><value>Software Engineering</value></json:item><json:item><value>Programming Techniques</value></json:item><json:item><value>Operating Systems</value></json:item></subject><isbn><json:string>978-3-540-25079-1</json:string></isbn><genre><json:string>book series</json:string></genre><language><json:string>unknown</json:string></language><eisbn><json:string>978-3-540-31845-3</json:string></eisbn><title>Multiparadigm Programming in Mozart/Oz</title><copyrightDate>2005</copyrightDate><doi><json:string>10.1007/b106627</json:string></doi></host><copyrightDate>2005</copyrightDate><doi><json:string>10.1007/978-3-540-31845-3_19</json:string></doi><id>7CD2E4CB89989028AD9DCB215FE8B1480BC441C4</id><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/7CD2E4CB89989028AD9DCB215FE8B1480BC441C4/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/7CD2E4CB89989028AD9DCB215FE8B1480BC441C4/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/7CD2E4CB89989028AD9DCB215FE8B1480BC441C4/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Implementing Semiring-Based Constraints Using Mozart</title><respStmt xml:id="ISTEX-API" resp="Références bibliographiques récupérées via GROBID" name="ISTEX-API (INIST-CNRS)"></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date>2005</date></publicationStmt><notesStmt><note>This work was partially supported by the Colombian Institute for Science and Technology Development (Colciencias) under the CRISOL project (Contract No. 298-2002).</note></notesStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Implementing Semiring-Based Constraints Using Mozart</title><author><persName><forename type="first">Alberto</forename><surname>Delgado</surname></persName><email>albertod@puj.edu.co</email><affiliation>Pontificia Universidad Javeriana, Cali</affiliation></author><author><persName><forename type="first">Carlos</forename><surname>Olarte</surname></persName><email>caolarte@atlas.puj.edu.co</email><affiliation>Pontificia Universidad Javeriana, Cali</affiliation></author><author><persName><forename type="first">Jorge</forename><surname>Pérez</surname></persName><email>japerezp@puj.edu.co</email><affiliation>Pontificia Universidad Javeriana, Cali</affiliation></author><author><persName><forename type="first">Camilo</forename><surname>Rueda</surname></persName><email>crueda@atlas.puj.edu.co</email><affiliation>Pontificia Universidad Javeriana, Cali</affiliation></author></analytic><monogr><title level="m">Multiparadigm Programming in Mozart/Oz</title><title level="m" type="sub">Second International Conference, MOZ 2004, Charleroi, Belgium, October 7-8, 2004, Revised Selected and Invited Papers</title><idno type="pISBN">978-3-540-25079-1</idno><idno type="eISBN">978-3-540-31845-3</idno><idno type="DOI">10.1007/b106627</idno><idno type="BookID">978-3-540-31845-3</idno><idno type="BookTitleID">116926</idno><idno type="BookSequenceNumber">3389</idno><idno type="BookVolumeNumber">3389</idno><idno type="BookChapterCount">26</idno><editor><persName><forename type="first">Peter</forename><surname>Van Roy</surname></persName><email>pvr@info.ucl.ac.be</email><affiliation>Department of Computing Science and Engineering, Université catholique de Louvain, Place Sainte Barbe, 2, B-1348, Louvain-la-Neuve, Belgium</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date>2005</date><biblScope unit="volume">3389</biblScope><biblScope unit="page" from="224">224</biblScope><biblScope unit="page" to="236">236</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">David</forename><surname>Hutchison</surname></persName><affiliation>Lancaster University, UK</affiliation></editor><editor><persName><forename type="first">Takeo</forename><surname>Kanade</surname></persName><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation></editor><editor><persName><forename type="first">Josef</forename><surname>Kittler</surname></persName><affiliation>University of Surrey, Guildford, UK</affiliation></editor><editor><persName><forename type="first">Jon</forename><forename type="first">M.</forename><surname>Kleinberg</surname></persName><affiliation>Cornell University, Ithaca, NY, USA</affiliation></editor><editor><persName><forename type="first">Friedemann</forename><surname>Mattern</surname></persName><affiliation>ETH Zurich, Switzerland</affiliation></editor><editor><persName><forename type="first">John</forename><forename type="first">C.</forename><surname>Mitchell</surname></persName><affiliation>Stanford University, CA, USA</affiliation></editor><editor><persName><forename type="first">Moni</forename><surname>Naor</surname></persName><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation></editor><editor><persName><forename type="first">Oscar</forename><surname>Nierstrasz</surname></persName><affiliation>University of Bern, Switzerland</affiliation></editor><editor><persName><forename type="first">C.</forename><surname>Pandu Rangan</surname></persName><affiliation>Indian Institute of Technology, Madras, India</affiliation></editor><editor><persName><forename type="first">Bernhard</forename><surname>Steffen</surname></persName><affiliation>University of Dortmund, Germany</affiliation></editor><editor><persName><forename type="first">Madhu</forename><surname>Sudan</surname></persName><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation></editor><editor><persName><forename type="first">Demetri</forename><surname>Terzopoulos</surname></persName><affiliation>New York University, NY, USA</affiliation></editor><editor><persName><forename type="first">Dough</forename><surname>Tygar</surname></persName><affiliation>University of California, Berkeley, CA, USA</affiliation></editor><editor><persName><forename type="first">Moshe</forename><forename type="first">Y.</forename><surname>Vardi</surname></persName><affiliation>Rice University, Houston, TX, USA</affiliation></editor><editor><persName><forename type="first">Gerhard</forename><surname>Weikum</surname></persName><affiliation>Max-Planck Institute of Computer Science, Saarbruecken, Germany</affiliation></editor><biblScope><date>2005</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="seriesId">558</idno></series><idno type="istex">7CD2E4CB89989028AD9DCB215FE8B1480BC441C4</idno><idno type="DOI">10.1007/978-3-540-31845-3_19</idno><idno type="ChapterID">Chap19</idno><idno type="ChapterID">19</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2005</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and preferences is still a matter for research. Several formal frameworks for soft constraints have been proposed within the CP community: all of them seem to be theoretically solid, but few practical implementations exist. In this paper we present an implementation for Mozart of one of these frameworks, which is based on a semiring structure. We explain how the soft constraints constructs were adapted to the propagation process that Mozart performs, and show how they can be transparently integrated with current Mozart hard propagators. Additionally, we show how over-constrained problems can be successfully relaxed and solved, and how preferences can be added to a problem, while keeping the formal model as a direct reference.</p></abstract><textClass><keywords scheme="Book Subject Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book Subject Group"><list><label>I</label><label>I14037</label><label>I1603X</label><label>I14029</label><label>I14010</label><label>I14045</label><item><term>Computer Science</term></item><item><term>Programming Languages, Compilers, Interpreters</term></item><item><term>Logics and Meanings of Programs</term></item><item><term>Software Engineering</term></item><item><term>Programming Techniques</term></item><item><term>Operating Systems</term></item></list></keywords></textClass></profileDesc><revisionDesc><change>undefined</change><change>[object Object]</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/7CD2E4CB89989028AD9DCB215FE8B1480BC441C4/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>David</GivenName><FamilyName>Hutchison</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName><FamilyName>Kanade</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName><FamilyName>Kittler</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName><GivenName>M.</GivenName><FamilyName>Kleinberg</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName><FamilyName>Mattern</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>John</GivenName><GivenName>C.</GivenName><FamilyName>Mitchell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName><FamilyName>Naor</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName><FamilyName>Nierstrasz</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName><FamilyName>Pandu Rangan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName><FamilyName>Steffen</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName><FamilyName>Sudan</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName><FamilyName>Terzopoulos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Dough</GivenName><FamilyName>Tygar</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName><GivenName>Y.</GivenName><FamilyName>Vardi</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Weikum</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Lancaster University</OrgName><OrgAddress><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>University of Surrey</OrgName><OrgAddress><City>Guildford</City><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgName>Cornell University</OrgName><OrgAddress><City>Ithaca</City><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgName>ETH Zurich</OrgName><OrgAddress><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>Stanford University</OrgName><OrgAddress><City>CA</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff7"><OrgName>Weizmann Institute of Science</OrgName><OrgAddress><City>Rehovot</City><Country>Israel</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgName>University of Bern</OrgName><OrgAddress><Country>Switzerland</Country></OrgAddress></Affiliation><Affiliation ID="Aff9"><OrgName>Indian Institute of Technology</OrgName><OrgAddress><City>Madras</City><Country>India</Country></OrgAddress></Affiliation><Affiliation ID="Aff10"><OrgName>University of Dortmund</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff11"><OrgName>Massachusetts Institute of Technology</OrgName><OrgAddress><City>MA</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff12"><OrgName>New York University</OrgName><OrgAddress><City>NY</City><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff13"><OrgName>University of California</OrgName><OrgAddress><City>Berkeley</City><State>CA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff14"><OrgName>Rice University</OrgName><OrgAddress><City>Houston</City><State>TX</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff15"><OrgName>Max-Planck Institute of Computer Science</OrgName><OrgAddress><City>Saarbruecken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-540-31845-3</BookID><BookTitle>Multiparadigm Programming in Mozart/Oz</BookTitle><BookSubTitle>Second International Conference, MOZ 2004, Charleroi, Belgium, October 7-8, 2004, Revised Selected and Invited Papers</BookSubTitle><BookVolumeNumber>3389</BookVolumeNumber><BookSequenceNumber>3389</BookSequenceNumber><BookDOI>10.1007/b106627</BookDOI><BookTitleID>116926</BookTitleID><BookPrintISBN>978-3-540-25079-1</BookPrintISBN><BookElectronicISBN>978-3-540-31845-3</BookElectronicISBN><BookChapterCount>26</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2005</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I14037" Priority="1" Type="Secondary">Programming Languages, Compilers, Interpreters</BookSubject><BookSubject Code="I1603X" Priority="2" Type="Secondary">Logics and Meanings of Programs</BookSubject><BookSubject Code="I14029" Priority="3" Type="Secondary">Software Engineering</BookSubject><BookSubject Code="I14010" Priority="4" Type="Secondary">Programming Techniques</BookSubject><BookSubject Code="I14045" Priority="5" Type="Secondary">Operating Systems</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Peter</GivenName><Particle>Van</Particle><FamilyName>Roy</FamilyName></EditorName><Contact><Email>pvr@info.ucl.ac.be</Email></Contact></Editor><Affiliation ID="Aff16"><OrgDivision>Department of Computing Science and Engineering</OrgDivision><OrgName>Université catholique de Louvain</OrgName><OrgAddress><Street>Place Sainte Barbe, 2</Street><Postcode>B-1348</Postcode><City>Louvain-la-Neuve</City><Country>Belgium</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part8"><PartInfo TocLevels="0"><PartID>8</PartID><PartSequenceNumber>8</PartSequenceNumber><PartTitle>Constraint Research</PartTitle><PartChapterCount>4</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>Multiparadigm Programming in Mozart/Oz</BookTitle></PartContext></PartInfo><Chapter ID="Chap19" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>19</ChapterID><ChapterDOI>10.1007/978-3-540-31845-3_19</ChapterDOI><ChapterSequenceNumber>19</ChapterSequenceNumber><ChapterTitle Language="En">Implementing Semiring-Based Constraints Using Mozart</ChapterTitle><ChapterFirstPage>224</ChapterFirstPage><ChapterLastPage>236</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2005</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>8</PartID><BookID>978-3-540-31845-3</BookID><BookTitle>Multiparadigm Programming in Mozart/Oz</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff17"><AuthorName DisplayOrder="Western"><GivenName>Alberto</GivenName><FamilyName>Delgado</FamilyName></AuthorName><Contact><Email>albertod@puj.edu.co</Email></Contact></Author><Author AffiliationIDS="Aff17"><AuthorName DisplayOrder="Western"><GivenName>Carlos</GivenName><GivenName>Alberto</GivenName><FamilyName>Olarte</FamilyName></AuthorName><Contact><Email>caolarte@atlas.puj.edu.co</Email></Contact></Author><Author AffiliationIDS="Aff17"><AuthorName DisplayOrder="Western"><GivenName>Jorge</GivenName><GivenName>Andrés</GivenName><FamilyName>Pérez</FamilyName></AuthorName><Contact><Email>japerezp@puj.edu.co</Email></Contact></Author><Author AffiliationIDS="Aff17"><AuthorName DisplayOrder="Western"><GivenName>Camilo</GivenName><FamilyName>Rueda</FamilyName></AuthorName><Contact><Email>crueda@atlas.puj.edu.co</Email></Contact></Author><Affiliation ID="Aff17"><OrgName>Pontificia Universidad Javeriana</OrgName><OrgAddress><City>Cali</City></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and preferences is still a matter for research. Several formal frameworks for soft constraints have been proposed within the CP community: all of them seem to be theoretically solid, but few practical implementations exist. In this paper we present an implementation for Mozart of one of these frameworks, which is based on a semiring structure. We explain how the soft constraints constructs were adapted to the propagation process that Mozart performs, and show how they can be transparently integrated with current Mozart hard propagators. Additionally, we show how over-constrained problems can be successfully relaxed and solved, and how preferences can be added to a problem, while keeping the formal model as a direct reference.</Para></Abstract><ArticleNote Type="Misc"><SimplePara>This work was partially supported by the Colombian Institute for Science and Technology Development (Colciencias) under the CRISOL project (Contract No. 298-2002).</SimplePara></ArticleNote></ChapterHeader><NoBody></NoBody></Chapter></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Implementing Semiring-Based Constraints Using Mozart</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Implementing Semiring-Based Constraints Using Mozart</title></titleInfo><name type="personal"><namePart type="given">Alberto</namePart><namePart type="family">Delgado</namePart><affiliation>Pontificia Universidad Javeriana, Cali</affiliation><affiliation>E-mail: albertod@puj.edu.co</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Carlos</namePart><namePart type="given">Alberto</namePart><namePart type="family">Olarte</namePart><affiliation>Pontificia Universidad Javeriana, Cali</affiliation><affiliation>E-mail: caolarte@atlas.puj.edu.co</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Jorge</namePart><namePart type="given">Andrés</namePart><namePart type="family">Pérez</namePart><affiliation>Pontificia Universidad Javeriana, Cali</affiliation><affiliation>E-mail: japerezp@puj.edu.co</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Camilo</namePart><namePart type="family">Rueda</namePart><affiliation>Pontificia Universidad Javeriana, Cali</affiliation><affiliation>E-mail: crueda@atlas.puj.edu.co</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="Book Chapter">OriginalPaper</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><copyrightDate encoding="w3cdtf">2005</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: Although Constraint Programming (CP) is considered a useful tool for tackling combinatorial problems, its lack of flexibility when dealing with uncertainties and preferences is still a matter for research. Several formal frameworks for soft constraints have been proposed within the CP community: all of them seem to be theoretically solid, but few practical implementations exist. In this paper we present an implementation for Mozart of one of these frameworks, which is based on a semiring structure. We explain how the soft constraints constructs were adapted to the propagation process that Mozart performs, and show how they can be transparently integrated with current Mozart hard propagators. Additionally, we show how over-constrained problems can be successfully relaxed and solved, and how preferences can be added to a problem, while keeping the formal model as a direct reference.</abstract><note>This work was partially supported by the Colombian Institute for Science and Technology Development (Colciencias) under the CRISOL project (Contract No. 298-2002).</note><relatedItem type="host"><titleInfo><title>Multiparadigm Programming in Mozart/Oz</title><subTitle>Second International Conference, MOZ 2004, Charleroi, Belgium, October 7-8, 2004, Revised Selected and Invited Papers</subTitle></titleInfo><name type="personal"><namePart type="given">Peter</namePart><namePart type="family">Van Roy</namePart><affiliation>Department of Computing Science and Engineering, Université catholique de Louvain, Place Sainte Barbe, 2, B-1348, Louvain-la-Neuve, Belgium</affiliation><affiliation>E-mail: pvr@info.ucl.ac.be</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book series">Proceedings</genre><originInfo><copyrightDate encoding="w3cdtf">2005</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book Subject Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book Subject Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I14037">Programming Languages, Compilers, Interpreters</topic><topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic><topic authority="SpringerSubjectCodes" authorityURI="I14029">Software Engineering</topic><topic authority="SpringerSubjectCodes" authorityURI="I14010">Programming Techniques</topic><topic authority="SpringerSubjectCodes" authorityURI="I14045">Operating Systems</topic></subject><identifier type="DOI">10.1007/b106627</identifier><identifier type="ISBN">978-3-540-25079-1</identifier><identifier type="eISBN">978-3-540-31845-3</identifier><identifier type="BookTitleID">116926</identifier><identifier type="BookID">978-3-540-31845-3</identifier><identifier type="BookChapterCount">26</identifier><identifier type="BookVolumeNumber">3389</identifier><identifier type="BookSequenceNumber">3389</identifier><identifier type="PartChapterCount">4</identifier><part><date>2005</date><detail type="part"><title>Constraint Research</title></detail><detail type="volume"><number>3389</number><caption>vol.</caption></detail><extent unit="pages"><start>224</start><end>236</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2005</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">David</namePart><namePart type="family">Hutchison</namePart><affiliation>Lancaster University, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Takeo</namePart><namePart type="family">Kanade</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Josef</namePart><namePart type="family">Kittler</namePart><affiliation>University of Surrey, Guildford, UK</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jon</namePart><namePart type="given">M.</namePart><namePart type="family">Kleinberg</namePart><affiliation>Cornell University, Ithaca, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Friedemann</namePart><namePart type="family">Mattern</namePart><affiliation>ETH Zurich, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">John</namePart><namePart type="given">C.</namePart><namePart type="family">Mitchell</namePart><affiliation>Stanford University, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moni</namePart><namePart type="family">Naor</namePart><affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Oscar</namePart><namePart type="family">Nierstrasz</namePart><affiliation>University of Bern, Switzerland</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">C.</namePart><namePart type="family">Pandu Rangan</namePart><affiliation>Indian Institute of Technology, Madras, India</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Bernhard</namePart><namePart type="family">Steffen</namePart><affiliation>University of Dortmund, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Madhu</namePart><namePart type="family">Sudan</namePart><affiliation>Massachusetts Institute of Technology, MA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Demetri</namePart><namePart type="family">Terzopoulos</namePart><affiliation>New York University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Dough</namePart><namePart type="family">Tygar</namePart><affiliation>University of California, Berkeley, CA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Moshe</namePart><namePart type="given">Y.</namePart><namePart type="family">Vardi</namePart><affiliation>Rice University, Houston, TX, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Weikum</namePart><affiliation>Max-Planck Institute of Computer Science, Saarbruecken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book series">series</genre><originInfo><copyrightDate encoding="w3cdtf">2005</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2005</recordOrigin></recordInfo></relatedItem><identifier type="istex">7CD2E4CB89989028AD9DCB215FE8B1480BC441C4</identifier><identifier type="DOI">10.1007/978-3-540-31845-3_19</identifier><identifier type="ChapterID">Chap19</identifier><identifier type="ChapterID">19</identifier><accessCondition type="use and reproduction" contentType="Copyright">Springer-Verlag Berlin Heidelberg</accessCondition><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2005</recordOrigin></recordInfo></mods></metadata><enrichments><istex:refBibTEI uri="https://api.istex.fr/document/7CD2E4CB89989028AD9DCB215FE8B1480BC441C4/enrichments/refBib"><teiHeader></teiHeader><text><front></front><body></body><back><listBibl><biblStruct xml:id="b0"><analytic><title level="a" type="main">The rough guide to constraint propagation</title><author><persName><forename type="first">R</forename><surname>Krzysztof</surname></persName></author><author><persName><surname>Apt</surname></persName></author></analytic><monogr><title level="m">Principles and Practice of Constraint Programming</title><imprint><date type="published" when="1999"></date><biblScope unit="page" from="1" to="23"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b1"><analytic><title level="a" type="main">Semirings for Soft Constraint Solving and Programming</title><author><persName><forename type="first">Stefano</forename><surname>Bistarelli</surname></persName></author></analytic><monogr><title level="m">Number 2962 in LNCS</title><imprint><publisher>Springer-Verlag</publisher><date type="published" when="2004"></date></imprint></monogr></biblStruct><biblStruct xml:id="b2"><analytic><title level="a" type="main">Labeling and partial local consistency for soft constraint programming</title><author><persName><forename type="first">Stefano</forename><surname>Bistarelli</surname></persName></author><author><persName><forename type="first">Philippe</forename><surname>Codognet</surname></persName></author><author><persName><forename type="first">Yan</forename><surname>Georget</surname></persName></author><author><persName><forename type="first">Francesca</forename><surname>Rossi</surname></persName></author></analytic><monogr><title level="j">Lecture Notes in Computer Science</title><imprint><date type="published" when="1753"></date></imprint></monogr></biblStruct><biblStruct xml:id="b3"><analytic><title level="a" type="main">Abstracting soft constraints: framework, properties, examples</title><author><persName><forename type="first">Stefano</forename><surname>Bistarelli</surname></persName></author><author><persName><forename type="first">Philippe</forename><surname>Codognet</surname></persName></author><author><persName><forename type="first">Francesca</forename><surname>Rossi</surname></persName></author></analytic><monogr><title level="j">Artif. Intell</title><imprint><biblScope unit="volume">139</biblScope><biblScope unit="issue">2</biblScope><date type="published" when="2002"></date></imprint></monogr></biblStruct><biblStruct xml:id="b4"><analytic><title level="a" type="main">Soft constraint propagation and solving in constraint handling rules</title><author><persName><forename type="first">Stefano</forename><surname>Bistarelli</surname></persName></author><author><persName><forename type="first">Thom</forename><surname>Frühwirth</surname></persName></author><author><persName><forename type="first">Michael</forename><surname>Marte</surname></persName></author><author><persName><forename type="first">Francesca</forename><surname>Rossi</surname></persName></author></analytic><monogr><title level="m">Proc. of the Third Workshop on Rule-Based Constraint Reasoning and Programming</title><meeting>. of the Third Workshop on Rule-Based Constraint Reasoning and Programming</meeting><imprint><date type="published" when="2001"></date></imprint></monogr></biblStruct><biblStruct xml:id="b5"><analytic><title level="a" type="main">Constraint propagation for soft constraints: Generalization and termination conditions</title><author><persName><forename type="first">Stefano</forename><surname>Bistarelli</surname></persName></author><author><persName><forename type="first">Rosella</forename><surname>Gennari</surname></persName></author><author><persName><forename type="first">Francesca</forename><surname>Rossi</surname></persName></author></analytic><monogr><title level="m">Principles and Practice of Constraint Programming</title><imprint><date type="published" when="2000"></date><biblScope unit="page" from="83" to="97"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b6"><analytic><title level="a" type="main">Soft concurrent constraint programming</title><author><persName><forename type="first">Stefano</forename><surname>Bistarelli</surname></persName></author><author><persName><forename type="first">Ugo</forename><surname>Montanari</surname></persName></author><author><persName><forename type="first">Francesca</forename><surname>Rossi</surname></persName></author></analytic><monogr><title level="m">European Symposium on Programming</title><imprint><date type="published" when="2002"></date></imprint></monogr></biblStruct><biblStruct xml:id="b7"><analytic><title level="a" type="main">Reasoning with ceteris paribus preference statements</title><author><persName><forename type="first">Craig</forename><surname>Boutilier</surname></persName></author><author><persName><forename type="first">Ronen</forename><forename type="middle">I</forename><surname>Brafman</surname></persName></author><author><persName><forename type="first">Holger</forename><forename type="middle">H</forename><surname>Hoos</surname></persName></author><author><persName><forename type="first">David</forename><surname>Poole</surname></persName></author></analytic><monogr><title level="m">Proc. 15th Conf. on Uncertainty in AI</title><meeting>. 15th Conf. on Uncertainty in AI</meeting><imprint><date type="published" when="1999"></date><biblScope unit="page" from="71" to="80"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b8"><analytic><title level="a" type="main">Compiling semiring-based constraints with clp(fd,s)</title><author><persName><forename type="first">Yan</forename><surname>Georget</surname></persName></author><author><persName><forename type="first">Philippe</forename><surname>Codognet</surname></persName></author></analytic><monogr><title level="m">Proceedings of CP'98</title><meeting>CP'98</meeting><imprint><date type="published" when="1998"></date></imprint></monogr></biblStruct><biblStruct xml:id="b9"><analytic><title level="a" type="main">Evaluation-based semiring metaconstraints</title><author><persName><forename type="first">Jerome</forename><surname>Kelleher</surname></persName></author><author><persName><forename type="first">O '</forename><surname>Barry</surname></persName></author><author><persName><surname>Sullivan</surname></persName></author></analytic><monogr><title level="m">Proceedings of MICAI</title><meeting>MICAI</meeting><imprint><date type="published" when="2004-04"></date></imprint></monogr></biblStruct><biblStruct xml:id="b10"><monogr><title level="m" type="main">The Mozart Constraint Extensions Reference Available electronically at www.mozart-oz.org</title><author><persName><forename type="first">Tobias</forename><surname>Muller</surname></persName></author><imprint><date type="published" when="2004-04"></date></imprint></monogr></biblStruct><biblStruct xml:id="b11"><analytic><title level="a" type="main">Abstracting soft constraints: some experimental results</title><author><persName><forename type="first">I</forename><surname>Pilan</surname></persName></author><author><persName><forename type="first">F</forename><surname>Rossi</surname></persName></author></analytic><monogr><title level="m">Proc. ERCIM/Colognet workshop on CLP and constraint solving</title><meeting>. ERCIM/Colognet workshop on CLP and constraint solving</meeting><imprint><date type="published" when="2003-06"></date></imprint></monogr></biblStruct><biblStruct xml:id="b12"><monogr><title level="m" type="main">Cp-networks: semantics, complexity, approximations and extensions</title><author><persName><forename type="first">F</forename><surname>Rossi</surname></persName></author><author><persName><forename type="first">K</forename><forename type="middle">B</forename><surname>Venable</surname></persName></author><author><persName><forename type="first">T</forename><surname>Walsh</surname></persName></author><imprint></imprint></monogr></biblStruct><biblStruct xml:id="b13"><monogr><title level="m" type="main">Finite Domain Constraint Programming in Oz -A Tutorial. Available electronically at www.mozart-oz.org</title><author><persName><forename type="first">Christian</forename><surname>Schulte</surname></persName></author><author><persName><forename type="first">Gert</forename><surname>Smolka</surname></persName></author><imprint><date type="published" when="2004-04"></date></imprint></monogr></biblStruct></listBibl></back></text></istex:refBibTEI></enrichments></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Musique/explor/MozartV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000024 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000024 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Musique
|area= MozartV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:7CD2E4CB89989028AD9DCB215FE8B1480BC441C4
|texte= Implementing Semiring-Based Constraints Using Mozart
}}
| This area was generated with Dilib version V0.6.20. |  |