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 « Resp »
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.
Resources subsystem < Resp < Resp peaks  Facettes :

List of bibliographic references indexed by Resp

Number of relevant bibliographic references: 37.
[0-20] [0 - 20][0 - 37][20-36][20-40]
Ident.Authors (with country if any)Title
004404 (2008) M. Renouf [France] ; N. Fillot [France]Coupling electrical and mechanical effects in discrete element simulations
008817 (2002) Current Awareness: Pharmacoepidemiology and Drug Safety
009194 (2001) D. Pomorski [France] ; P. B. Perche [France]Inductive learning of decision trees: application to fault isolation of an induction motor
009320 (2001) N. Peltier [France]On the decidability of the PVD class with equality
009334 (2001) François Fages [France] ; Paul Ruet [France] ; Sylvain Soliman [France]Linear Concurrent Constraint Programming: Operational and Phase Semantics
009400 (2001) Sorin Stratulat [France]A General Framework to Build Contextual Cover Set Induction Provers
009D07 (2000) Hélène Kirchner [France] ; Isabelle Gnaedig [France]Termination and normalisation under strategy Proofs in ELAN
009D11 (2000) Adel Bouhoula [États-Unis, France] ; Jean-Pierre Jouannaud [France] ; José Meseguer [États-Unis]Specification and proof in membership equational logic
009D19 (2000) D. Galmiche [France] ; J. M. Notin [France]Proof-search and Proof Nets in Mixed Linear Logic
009D56 (2000) D. Galmiche [France]Connection methods in linear logic and proof nets construction
009D57 (2000) Delia Kesner [France]Confluence of extensional and non-extensional λ-calculi with explicit substitutions
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
009E83 (2000) L. Djerid [France] ; M-C. Portmann [France]How to keep good schemata using cross‐over operators for permutation problems
009F00 (2000) Mireille Bousquet-Mélou [France] ; Gilles Schaeffer [France]Enumeration of Planar Constellations
009F22 (2000) Ricardo Caferra [France] ; Nicolas PeltierCombining Enumeration and Deductive Techniques in order to Increase the Class of Constructible Infinite Models
00A824 (1999) Alain Denise [France] ; Paul Zimmermann [France]Uniform random generation of decomposable structures using floating-point arithmetic
00B235 (1998) D. Galmiche [France] ; B. Martin [France]Proof nets Construction and Automated Deduction in Non-Commutative Linear Logic
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

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

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