Teeft.i
Checkpoint
Istex
Racine
Checkpoint
Istex
Exploration
Accueil
Racine
Racine

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

Index « Teeft.i » - entrée « Ground term »
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.
Ground surface < Ground term < Ground term tuple  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 28.
[0-20] [0 - 20][0 - 28][20-27][20-40]
Ident.Authors (with country if any)Title
001D12 (2001) E. A. Cichon [France] ; E. Tahhan-Bittar [Venezuela]Strictly orthogonal left linear rewrite systems and primitive recursion
001D65 (2001) Pierre-Etienne Moreau [France] ; Christophe Ringeissen [France] ; Marian Vittek [Slovaquie]A Pattern-Matching Compiler
001D95 (2001) Georg Gottlob [Autriche] ; Reinhard Pichler [Autriche]Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models
001F59 (2000) Hélène Kirchner [France] ; Isabelle Gnaedig [France]Termination and normalisation under strategy Proofs in ELAN
001F63 (2000) Adel Bouhoula [États-Unis, France] ; Jean-Pierre Jouannaud [France] ; José Meseguer [États-Unis]Specification and proof in membership equational logic
002057 (2000) Miki Hermann [France] ; Phokion G. KolaitisUnification Algorithms Cannot Be Combined in Polynomial Time
002086 (2000) Hubert Comon [France]Sequentiality, Monadic Second-Order Logic and Tree Automata
002108 (2000) Jordi Levy [Espagne] ; Margus Veanes [Colombie]On the Undecidability of Second-Order Unification
002134 (2000) Hubert Comon [France] ; Robert Nieuwenhuis [Espagne]Induction=I-Axiomatization+First-Order Consistency
002209 (1999) David A. Plaisted [États-Unis] ; Gregory Kucherov [États-Unis, France]The complexity of some complementation problems
002399 (1999) Joost Engelfriet [Pays-Bas]Derivation Trees of Ground Term Rewriting Systems
002462 (1998) M. R. K. Krishna Rao [Inde] ; Deepak Kapur [Inde] ; R. K. Shyamasundar [Inde]Transformational methodology for proving termination of logic programs
002577 (1998) M. Fernández [France]Negation Elimination in Empty or Permutative Theories
002636 (1998) A. Werner [Allemagne]A Semantic Approach to Order-sorted Rewriting
002759 (1997) Robert Nieuwenhuis [Espagne] ; Albert Rubio [Espagne]Paramodulation with Built-in AC-Theories and Symbolic Constraints
002764 (1997) Alfons Geser [Allemagne]Omega-Termination is Undecidable for Totally Terminating Term Rewriting Systems
002804 (1997) Adel Bouhoula [États-Unis]Automated Theorem Proving by Test Set Induction
002831 (1996) Adel Bouhoula [France]Using induction and rewriting to verify and complete parameterized specifications
002963 (1996) Francois Bronsard [France] ; Uday S. Reddy [États-Unis] ; Robert W. Hasker [États-Unis]Induction using term orders
002983 (1996) Christophe Ringeissen [France]Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories
002999 (1996) A. Geser [Allemagne]An Improved General Path Order

Pour manipuler ce document sous Unix (Dilib)

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

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Teeft.i -k "Ground term" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Teeft.i  \
                -Sk "Ground term" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd

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

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    Istex
   |étape=   Checkpoint
   |type=    indexItem
   |index=    Teeft.i
   |clé=    Ground term
}}
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