PascalFr.i
Checkpoint
PascalFrancis
Racine
Checkpoint
PascalFrancis
Exploration
Accueil
Racine
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Checkpoint (PascalFrancis)

Index « PascalFr.i » - entrée « Unification »
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.
Unicité solution < Unification < Unification algorithm  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 17.
Ident.Authors (with country if any)Title
000343 (2006) Mathieu Turuani [France]The CL-atse protocol analyser
000449 (2005) Clara Bertolissi [France]The graph rewriting calculus : Confluence and expressiveness
000664 (2003) Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France]Unification modulo ACUI plus homomorphisms/distributivity
000690 (2003) Christophe Ringeissen [France]Matching in a class of combined non-disjoint theories
000727 (2003) Siva Anantharaman [France] ; Paliath Narendran [États-Unis] ; Michael Rusinowitch [France]ACID-unification is NEXPTIME-decidable
000911 (2001) Hubert Comon [France] ; Claude Kirchner [France]Constraint solving on terms
000959 (2000) Miki Hermann [France] ; Phokion G. Kolaitis [États-Unis]Unification algorithms cannot be combined in polynomial time
000995 (2000) G. Dowek [France] ; T. Hardin [France] ; C. Kirchner [France]Higher order unification via explicit substitutions
000999 (2000) C. Ringeissen [France] ; E. Monfroy [Pays-Bas]Generating propagation rules for finite domains : A mixed approach
000B06 (1999) H. Comon [France] ; M. Dincbas [France] ; J.-P. Jouannaud [France] ; C. Kirchner [France]A methodological view of constraint solving
000C12 (1997) C. Ringeissen [France]Prototyping combination of unification algorithms with the ELAN rule-based programming language
000C19 (1997) M. Hermann [France] ; P. G. Kolaitis [États-Unis]On the complexity of unification and disunification in commutative idempotent semigroups
000C74 (1996) M. Hermann [France] ; P. G. Kolaitis [États-Unis]Unification algorithms cannot be combined in polynomial time
000D04 (1996) N. Berregeb [France] ; A. Bouhoula [France] ; M. Rusinowtich [France]Automated verification by induction with associative-commutative operators
000D58 (1992) E. Domenjoud [France]AC unification through order-sorted AC1 unification
000D66 (1991) N. Doggaz ; C. KirchnerCompletion for unification
000D81 (1987) Proceedings/2nd. International conference on rewriting techniques and applications, Bordeaux, France, May 25-27, 1987

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/PascalFrancis/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/PascalFr.i -k "Unification" 

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/PascalFr.i  \
                -Sk "Unification" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    indexItem
   |index=    PascalFr.i
   |clé=    Unification
}}
Wicri

This area was generated with Dilib version V0.6.33.
Data generation: Mon Jun 10 21:56:28 2019. Site generation: Fri Feb 25 15:29:27 2022