Teeft.i
Exploration
Accueil
Racine
Exploration
Accueil
Racine

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

Index « Teeft.i » - entrée « Decidable »
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.
Decidability status < Decidable < Decidable approximations  Facettes :

List of bibliographic references indexed by Decidable

Number of relevant bibliographic references: 23.
[0-20] [0 - 20][0 - 23][20-22][20-40]
Ident.Authors (with country if any)Title
009262 (2001) H. Cirstea [France] ; K. Kirchner [France]The rewriting calculus - part I
009264 (2001) Vincent D. Blondel [Belgique] ; Olivier Bournez [France] ; Pascal Koiran [France] ; John N. TsitsiklisThe Stability of Saturated Linear Dynamical Systems Is Undecidable
009320 (2001) N. Peltier [France]On the decidability of the PVD class with equality
009D11 (2000) Adel Bouhoula [États-Unis, France] ; Jean-Pierre Jouannaud [France] ; José Meseguer [États-Unis]Specification and proof in membership equational logic
009E33 (2000) Hubert Comon [France]Sequentiality, Monadic Second-Order Logic and Tree Automata
009E55 (2000) Jordi Levy [Espagne] ; Margus Veanes [Colombie]On the Undecidability of Second-Order Unification
00A834 (1999) Maria Paola Bonacina ; Bernhard GramlichPreface
00A851 (1999) Cumulative index volumes 1–200
00AA13 (1999) Joost Engelfriet [Pays-Bas]Derivation Trees of Ground Term Rewriting Systems
00B345 (1998) M. Fernández [France]Negation Elimination in Empty or Permutative Theories
00B359 (1998) Jean-Camille Birget [États-Unis]Infinite String Rewrite Systems and Complexity
00B375 (1998) C. Hintermeier [France] ; C. Kirchner [France] ; H. Kirchner [France]Dynamically Typed Computations for Order-sorted Equational Presentations
00B403 (1998) A. Werner [Allemagne]A Semantic Approach to Order-sorted Rewriting
00BB18 (1997) Miki Hermann [France] ; Roman Galbav [France]Unification of infinite sets of terms schematized by primal grammars
00C082 (1996) Christophe Ringeissen [France]Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories
00C105 (1996) Maribel Fernández [France]AC Complement Problems: Satisfiability and Negation Elimination
00C607 (1995) Gregory Kucherov [France] ; Michaël Rusinowitch [France]Undecidability of ground reducibility for word rewriting systems with variables
00C627 (1995) Lila Kari [Finlande] ; Alexandru Mateescu [Finlande] ; Gheorghe Pa Un [Roumanie] ; Arto Salomaa [Finlande]Multi-pattern languages
00C658 (1995) Rolf Backofen [Allemagne]A complete axiomatization of a theory with feature and arity constraints
00D176 (1993) Eddy Bevers [Belgique] ; Johan Lewi [Belgique]Proving termination of (conditional) rewrite systems
00D657 (1992) Maribel Fernández [France]Narrowing based procedures for equational disunification

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

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/Teeft.i  \
                -Sk "Decidable" \
         | 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é=    Decidable
}}
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