Serveur d'exploration sur la recherche en informatique en Lorraine - Exploration (Accueil)

Index « Teeft.i » - entrée « Equational »
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.
Equation systems < Equational < Equational axioms  Facettes :

List of bibliographic references indexed by Equational

Number of relevant bibliographic references: 60.
[0-20] [0 - 20][0 - 50][20-40]
Ident.Authors (with country if any)Title
009185 (2001) Bernhard Gramlich [Autriche]On interreduction of semi-complete term rewriting systems
009224 (2001) Pierre-Etienne Moreau [France] ; Christophe Ringeissen [France] ; Marian Vittek [Slovaquie]A Pattern-Matching Compiler
009254 (2001) Georg Gottlob [Autriche] ; Reinhard Pichler [Autriche]Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models
009262 (2001) H. Cirstea [France] ; K. Kirchner [France]The rewriting calculus - part I
009320 (2001) N. Peltier [France]On the decidability of the PVD class with equality
009389 (2001) He Le Ne Kirchner ; Peter D. MossesAlgebraic Specifications, Higher‐order Types and Set‐theoretic Models
009400 (2001) Sorin Stratulat [France]A General Framework to Build Contextual Cover Set Induction Provers
009D11 (2000) Adel Bouhoula [États-Unis, France] ; Jean-Pierre Jouannaud [France] ; José Meseguer [États-Unis]Specification and proof in membership equational logic
009D21 (2000) D. GalmichePreface
009D41 (2000) Patrick Viry [Italie]Input/Output for ELAN
009E04 (2000) Miki Hermann [France] ; Phokion G. KolaitisUnification Algorithms Cannot Be Combined in Polynomial Time
009E27 (2000) Reinhard PichlerSpeeding up Algorithms on Atomic Representations of Herbrand Models via New Redundancy Criteria
009E81 (2000) Hubert Comon [France] ; Robert Nieuwenhuis [Espagne]Induction=I-Axiomatization+First-Order Consistency
009E84 (2000) Gilles Dowek [France] ; Thérèse Hardin [France] ; Claude Kirchner [France]Higher Order Unification via Explicit Substitutions
009F22 (2000) Ricardo Caferra [France] ; Nicolas PeltierCombining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models
00A832 (1999) Mark Van Den Brand ; Rakesh VermaPreface
00A834 (1999) Maria Paola Bonacina ; Bernhard GramlichPreface
00A851 (1999) Cumulative index volumes 1–200
00AA68 (1999) K. Stokkermans [Autriche]A Categorical Critical-pair Completion Algorithm
00B237 (1998) Didier GalmichePreface
00B345 (1998) M. Fernández [France]Negation Elimination in Empty or Permutative Theories

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Teeft.i -k "Equational" 
HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Teeft.i  \
                -Sk "Equational" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd 

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Main
   |étape=   Exploration
   |type=    indexItem
   |index=    Teeft.i
   |clé=    Equational
}}

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