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 « Irreducible »
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.
Irreducibility < Irreducible < Irreducible atom  Facettes :

List of bibliographic references indexed by Irreducible

Number of relevant bibliographic references: 24.
[0-20] [0 - 20][0 - 24][20-23][20-40]
Ident.Authors (with country if any)Title
009185 (2001) Bernhard Gramlich [Autriche]On interreduction of semi-complete term rewriting systems
009303 (2001) Cyril Banderier [France] ; Philippe Flajolet [France] ; Gilles Schaeffer [France] ; Michèle Soria [France]Random maps, coalescing saddles, singularity analysis, and Airy phenomena
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
009E81 (2000) Hubert Comon [France] ; Robert Nieuwenhuis [Espagne]Induction=I-Axiomatization+First-Order Consistency
00B345 (1998) M. Fernández [France]Negation Elimination in Empty or Permutative Theories
00B375 (1998) C. Hintermeier [France] ; C. Kirchner [France] ; H. Kirchner [France]Dynamically Typed Computations for Order-sorted Equational Presentations
00B382 (1998) H. Comon [France]Completion of Rewrite Systems with Membership Constraints Part I: Deduction Rules
00BC26 (1997) Robert Nieuwenhuis [Espagne] ; Albert Rubio [Espagne]Paramodulation with Built-in AC-Theories and Symbolic Constraints
00BC44 (1997) Nicolas Peltier [France]Increasing Model Building Capabilities by Constraint Solving on Terms with Integer Exponents
00BC71 (1997) Adel Bouhoula [États-Unis]Automated Theorem Proving by Test Set Induction
00BF30 (1996) Adel Bouhoula [France]Using induction and rewriting to verify and complete parameterized specifications
00C012 (1996) Sylvain Petitiean [France]The enumerative geometry of projective algebraic surfaces and the complexity of aspect graphs
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
00C649 (1995) Maria Alpuente [Espagne] ; Moreno Falaschi [Espagne] ; Ferdinando Manzo [Espagne]Analyses of unsatisfiability for equational logic programming
00C714 (1995) Emmanuel Kounalis [France] ; Michaël Rusinowitch [France]Reasoning with conditional axioms
00C747 (1995) Adel Bouhoula [France] ; Michaël Rusinowitch [France]Implicit induction in conditional theories
00C780 (1995) Michaël Rusinowitch [France] ; Laurent Vigneron [France]Automated deduction with associative-commutative operators
00E359 (1988) Paliath Narendran [États-Unis] ; Friedrich Otto [États-Unis]Elements of finite order for finite weight-reducing and confluent thue systems

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

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