Propagating differences : An efficient new fixpoint algorithm for distributive constraint systems
Identifieur interne : 000E70 ( PascalFrancis/Checkpoint ); précédent : 000E69; suivant : 000E71Propagating differences : An efficient new fixpoint algorithm for distributive constraint systems
Auteurs : C. Fecht [Allemagne] ; H. Seidl [Allemagne]Source :
- Lecture notes in computer science [ 0302-9743 ] ; 1998.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Langage de programmation.
English descriptors
Abstract
Integrating semi-naive fixpoint iteration from deductive data bases [3,2,4] as well as continuations into worklist-based solvers, we derive a new application independent local fixpoint algorithm for distributive constraint systems. Seemingly different efficient algorithms for interpretation like those for linear constant propagation for imperative languages [17] as well as for control-flow analysis for functional languages [13] turn out to be instances of our scheme. Besides this systematizing contribution we also derive a new efficient algorithm for abstract OLDT-resolution as considered in [15,16, 25] for Prolog.
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
Pascal:98-0234333Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Propagating differences : An efficient new fixpoint algorithm for distributive constraint systems</title>
<author><name sortKey="Fecht, C" sort="Fecht, C" uniqKey="Fecht C" first="C." last="Fecht">C. Fecht</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>Universität des Saarlandes, Postfach 151150</s1>
<s2>66041 Saarbrücken</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<placeName><region type="land" nuts="2">Sarre (Land)</region>
<settlement type="city">Sarrebruck</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Seidl, H" sort="Seidl, H" uniqKey="Seidl H" first="H." last="Seidl">H. Seidl</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Fachbereich IV - Informatik, Universität Trier</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<wicri:noRegion>54286 Trier</wicri:noRegion>
<wicri:noRegion>Universität Trier</wicri:noRegion>
<wicri:noRegion>54286 Trier</wicri:noRegion>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">98-0234333</idno>
<date when="1998">1998</date>
<idno type="stanalyst">PASCAL 98-0234333 INIST</idno>
<idno type="RBID">Pascal:98-0234333</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">001146</idno>
<idno type="wicri:Area/PascalFrancis/Curation">001679</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000E70</idno>
<idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">000E70</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Propagating differences : An efficient new fixpoint algorithm for distributive constraint systems</title>
<author><name sortKey="Fecht, C" sort="Fecht, C" uniqKey="Fecht C" first="C." last="Fecht">C. Fecht</name>
<affiliation wicri:level="3"><inist:fA14 i1="01"><s1>Universität des Saarlandes, Postfach 151150</s1>
<s2>66041 Saarbrücken</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<placeName><region type="land" nuts="2">Sarre (Land)</region>
<settlement type="city">Sarrebruck</settlement>
</placeName>
</affiliation>
</author>
<author><name sortKey="Seidl, H" sort="Seidl, H" uniqKey="Seidl H" first="H." last="Seidl">H. Seidl</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Fachbereich IV - Informatik, Universität Trier</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Allemagne</country>
<wicri:noRegion>54286 Trier</wicri:noRegion>
<wicri:noRegion>Universität Trier</wicri:noRegion>
<wicri:noRegion>54286 Trier</wicri:noRegion>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
<imprint><date when="1998">1998</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Lecture notes in computer science</title>
<idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Functional programming</term>
<term>Logical programming</term>
<term>Optimal algorithm</term>
<term>Programming language</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Langage programmation</term>
<term>Programmation logique</term>
<term>Programmation fonctionnelle</term>
<term>Algorithme optimal</term>
<term>Programmation sous contrainte</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Langage de programmation</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Integrating semi-naive fixpoint iteration from deductive data bases [3,2,4] as well as continuations into worklist-based solvers, we derive a new application independent local fixpoint algorithm for distributive constraint systems. Seemingly different efficient algorithms for interpretation like those for linear constant propagation for imperative languages [17] as well as for control-flow analysis for functional languages [13] turn out to be instances of our scheme. Besides this systematizing contribution we also derive a new efficient algorithm for abstract OLDT-resolution as considered in [15,16, 25] for Prolog.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0302-9743</s0>
</fA01>
<fA05><s2>1381</s2>
</fA05>
<fA08 i1="01" i2="1" l="ENG"><s1>Propagating differences : An efficient new fixpoint algorithm for distributive constraint systems</s1>
</fA08>
<fA09 i1="01" i2="1" l="ENG"><s1>Programming languages and systems : Lisbon, March 28 - April 4, 1998</s1>
</fA09>
<fA11 i1="01" i2="1"><s1>FECHT (C.)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>SEIDL (H.)</s1>
</fA11>
<fA12 i1="01" i2="1"><s1>HANKIN (Chris)</s1>
<s9>ed.</s9>
</fA12>
<fA14 i1="01"><s1>Universität des Saarlandes, Postfach 151150</s1>
<s2>66041 Saarbrücken</s2>
<s3>DEU</s3>
<sZ>1 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Fachbereich IV - Informatik, Universität Trier</s1>
<s2>54286 Trier</s2>
<s3>DEU</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>90-104</s1>
</fA20>
<fA21><s1>1998</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA26 i1="01"><s0>3-540-64302-8</s0>
</fA26>
<fA43 i1="01"><s1>INIST</s1>
<s2>16343</s2>
<s5>354000078902220070</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 1998 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>27 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>98-0234333</s0>
</fA47>
<fA60><s1>P</s1>
<s2>C</s2>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i2="1"><s0>Lecture notes in computer science</s0>
</fA64>
<fA66 i1="01"><s0>DEU</s0>
</fA66>
<fA66 i1="02"><s0>USA</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>Integrating semi-naive fixpoint iteration from deductive data bases [3,2,4] as well as continuations into worklist-based solvers, we derive a new application independent local fixpoint algorithm for distributive constraint systems. Seemingly different efficient algorithms for interpretation like those for linear constant propagation for imperative languages [17] as well as for control-flow analysis for functional languages [13] turn out to be instances of our scheme. Besides this systematizing contribution we also derive a new efficient algorithm for abstract OLDT-resolution as considered in [15,16, 25] for Prolog.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D02B02</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Langage programmation</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Programming language</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Lenguaje programación</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Programmation logique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Logical programming</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Programación lógica</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Programmation fonctionnelle</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Functional programming</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Programación funcional</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Algorithme optimal</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Optimal algorithm</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Algoritmo óptimo</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Programmation sous contrainte</s0>
<s4>INC</s4>
<s5>82</s5>
</fC03>
<fN21><s1>153</s1>
</fN21>
</pA>
<pR><fA30 i1="01" i2="1" l="ENG"><s1>ESOP '98 : European symposium on programming</s1>
<s2>7</s2>
<s3>Lisbon PRT</s3>
<s4>1998-03-28</s4>
</fA30>
</pR>
</standard>
</inist>
<affiliations><list><country><li>Allemagne</li>
</country>
<region><li>Sarre (Land)</li>
</region>
<settlement><li>Sarrebruck</li>
</settlement>
</list>
<tree><country name="Allemagne"><region name="Sarre (Land)"><name sortKey="Fecht, C" sort="Fecht, C" uniqKey="Fecht C" first="C." last="Fecht">C. Fecht</name>
</region>
<name sortKey="Seidl, H" sort="Seidl, H" uniqKey="Seidl H" first="H." last="Seidl">H. Seidl</name>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Rhénanie/explor/UnivTrevesV1/Data/PascalFrancis/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000E70 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000E70 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Rhénanie |area= UnivTrevesV1 |flux= PascalFrancis |étape= Checkpoint |type= RBID |clé= Pascal:98-0234333 |texte= Propagating differences : An efficient new fixpoint algorithm for distributive constraint systems }}
This area was generated with Dilib version V0.6.31. |