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 terms »
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 term tuple < Ground terms < Ground theory  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 30.
[0-20] [0 - 20][0 - 30][20-29][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
001E62 (2001) N. Peltier [France]On the decidability of the PVD class with equality
001F42 (2001) Sorin Stratulat [France]A General Framework to Build Contextual Cover Set Induction Provers
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
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
002175 (2000) Ricardo Caferra [France] ; Nicolas PeltierCombining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models
002209 (1999) David A. Plaisted [États-Unis] ; Gregory Kucherov [États-Unis, France]The complexity of some complementation problems
002577 (1998) M. Fernández [France]Negation Elimination in Empty or Permutative Theories
002614 (1998) H. Comon [France]Completion of Rewrite Systems with Membership Constraints Part II: Constraint Solving
002615 (1998) H. Comon [France]Completion of Rewrite Systems with Membership Constraints Part I: Deduction Rules
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
002777 (1997) Nicolas Peltier [France]Increasing Model Building Capabilities by Constraint Solving on Terms with Integer Exponents
002804 (1997) Adel Bouhoula [États-Unis]Automated Theorem Proving by Test Set Induction
002908 (1996) M. C. F. Ferreira [Pays-Bas] ; H. Zantema [Pays-Bas]Total termination of term rewriting
002963 (1996) Francois Bronsard [France] ; Uday S. Reddy [États-Unis] ; Robert W. Hasker [États-Unis]Induction using term orders
002994 (1996) Paliath Narendran [États-Unis] ; Michaël Rusinowitch [France]Any ground associative-commutative theory has a finite canonical system
002999 (1996) A. Geser [Allemagne]An Improved General Path Order
002A29 (1995) Valentin M. Antimirov [France] ; Peter D. Mosses [Danemark]Rewriting extended regular expressions

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 terms" 

HfdIndexSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/Teeft.i  \
                -Sk "Ground terms" \
         | 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 terms
}}
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