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 « Springer »
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.
Spring street < Springer < Springer gmbh  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 40.
[0-20] [0 - 20][0 - 40][20-40]
Ident.Authors (with country if any)Title
000020 (2014) W. Schilf [Pologne]Chapter 1 - Books and reviews
000172 (2013) Sergei O. Kuznetsov [Russie] ; Jonas Poelmans [Russie, Belgique]Knowledge representation and processing with formal concept analysis
001274 (2006) Boniface Nkemzi [Cameroun]On the solution of Maxwell's equations in polygonal domains
001984 (2003) Didier Galmiche ; Daniel Me RySemantic Labelled Tableaux for Propositional BI⊥
001D26 (2001) Bernhard Gramlich [Autriche]On interreduction of semi-complete term rewriting systems
001D95 (2001) Georg Gottlob [Autriche] ; Reinhard Pichler [Autriche]Working with ARMs: Complexity Results on Atomic Representations of Herbrand Models
001F42 (2001) Sorin Stratulat [France]A General Framework to Build Contextual Cover Set Induction Provers
001F63 (2000) Adel Bouhoula [États-Unis, France] ; Jean-Pierre Jouannaud [France] ; José Meseguer [États-Unis]Specification and proof in membership equational logic
001F70 (2000) Didier Galmiche [France] ; David J. Pym [Royaume-Uni]Proof-search in type-theoretic languages: an introduction
002009 (2000) D. Galmiche [France]Connection methods in linear logic and proof nets construction
002010 (2000) Delia Kesner [France]Confluence of extensional and non-extensional λ-calculi with explicit substitutions
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
002454 (1999) K. Stokkermans [Autriche]A Categorical Critical-pair Completion Algorithm
002462 (1998) M. R. K. Krishna Rao [Inde] ; Deepak Kapur [Inde] ; R. K. Shyamasundar [Inde]Transformational methodology for proving termination of logic programs
002607 (1998) C. Hintermeier [France] ; C. Kirchner [France] ; H. Kirchner [France]Dynamically Typed Computations for Order-sorted Equational Presentations
002613 (1998) B. Gibaud [France] ; S. Garlatti [France] ; C. Barillot [France] ; E. Faure [France]Computerized brain atlases as decision support systems: a methodological approach
002650 (1997) Miki Hermann [France] ; Roman Galbav [France]Unification of infinite sets of terms schematized by primal grammars
002651 (1997) Manuel M. T. Chakravarty [Japon] ; Hendrik C. R. Lock [Allemagne]Towards the uniform implementation of declarative languages
002689 (1997) Jean-Pierre Jouannaud [France] ; Mitsuhiro Okada [Japon]Abstract data type systems
002831 (1996) Adel Bouhoula [France]Using induction and rewriting to verify and complete parameterized specifications

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

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