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 « Inductive »
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.
Induction variables < Inductive < Inductive assumption  Facettes :

List of bibliographic references indexed by Inductive

Number of relevant bibliographic references: 26.
[0-20] [0 - 20][0 - 26][20-25][20-40]
Ident.Authors (with country if any)Title
009194 (2001) D. Pomorski [France] ; P. B. Perche [France]Inductive learning of decision trees: application to fault isolation of an induction motor
009352 (2001) Elias Dahlhaus [Allemagne] ; Jens Gustedt [France] ; Ross M. McconnellEfficient and Practical Algorithms for Sequential Modular Decomposition
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
009D18 (2000) Didier Galmiche [France] ; David J. Pym [Royaume-Uni]Proof-search in type-theoretic languages: an introduction
009D54 (2000) Didier Arquès [France] ; Alain Giorgetti [France]Counting rooted maps on a surface
009D56 (2000) D. Galmiche [France]Connection methods in linear logic and proof nets construction
009E81 (2000) Hubert Comon [France] ; Robert Nieuwenhuis [Espagne]Induction=I-Axiomatization+First-Order Consistency
00A827 (1999) Erik Grimmer-Solem [Royaume-Uni] ; Roberto Romani [Royaume-Uni]THE HISTORICAL SCHOOL, 1870–1900: A CROSS-NATIONAL REASSESSMENT
00A834 (1999) Maria Paola Bonacina ; Bernhard GramlichPreface
00A851 (1999) Cumulative index volumes 1–200
00BB18 (1997) Miki Hermann [France] ; Roman Galbav [France]Unification of infinite sets of terms schematized by primal grammars
00BB57 (1997) Jean-Pierre Jouannaud [France] ; Mitsuhiro Okada [Japon]Abstract data type systems
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
00C062 (1996) Francois Bronsard [France] ; Uday S. Reddy [États-Unis] ; Robert W. Hasker [États-Unis]Induction using term orders
00C098 (1996) A. Geser [Allemagne]An Improved General Path Order
00C684 (1995) Wlodzimierz Drabent [Pologne, Suède]What is failure? An approach to constructive negation
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
00D176 (1993) Eddy Bevers [Belgique] ; Johan Lewi [Belgique]Proving termination of (conditional) rewrite 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 "Inductive" 

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