Serveur d'exploration sur l'Université de Trèves

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Propagating differences : An efficient new fixpoint algorithm for distributive constraint systems

Identifieur interne : 002741 ( Main/Merge ); précédent : 002740; suivant : 002742

Propagating differences : An efficient new fixpoint algorithm for distributive constraint systems

Auteurs : C. Fecht [Allemagne] ; H. Seidl [Allemagne]

Source :

RBID : Pascal:98-0234333

Descripteurs français

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.

Links toward previous steps (curation, corpus...)


Links to Exploration step

Pascal:98-0234333

Le 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>
<idno type="wicri:doubleKey">0302-9743:1998:Fecht C:propagating:differences:an</idno>
<idno type="wicri:Area/Main/Merge">002741</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>
<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/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002741 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 002741 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Rhénanie
   |area=    UnivTrevesV1
   |flux=    Main
   |étape=   Merge
   |type=    RBID
   |clé=     Pascal:98-0234333
   |texte=   Propagating differences : An efficient new fixpoint algorithm for distributive constraint systems
}}

Wicri

This area was generated with Dilib version V0.6.31.
Data generation: Sat Jul 22 16:29:01 2017. Site generation: Wed Feb 28 14:55:37 2024