Keywords
Exploration
Accueil
Racine
Exploration
Accueil
Racine

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

Index « Keywords » - entrée « completeness »
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.
complete problems < completeness < completeness in the strong sense.  Facettes :

List of bibliographic references indexed by completeness

Number of relevant bibliographic references: 17.
Ident.Authors (with country if any)Title
002805 (2011) Isabelle Gnaedig [France] ; Hélène Kirchner [France]Proving weak properties of rewriting
005231 (2006) Patrick Blackburn [France] ; Balder Ten Cate [Pays-Bas]Pure Extensions, Proof Rules, and Hybrid Axiomatics
007846 (2003) Issam ChebbiAide à la preuve et à la validation en programmation par règles
008599 (2002) Gilles Dowek ; Thérèse Hardin ; Claude KirchnerBinding Logic : proofs and models
008F26 (2001) Dominique LarcheyRefutations as countermodels in intuitionistic linear logic
009B50 (2000) Didier Galmiche ; Dominique Larchey-WendlingResource models and proof-search in Intuitionistic Linear Logic
00A638 (1999) Didier Galmiche ; Dominique Larchey-WendlingFrom Ordered Monoids to Quantales and Petri Nets : Revised Semantics and Completeness Results in Intuitionistic Linear Logic
00A765 (1999) Adel BouhoulaSimultaneous Checking of Completeness and Ground Confluence
00A790 (1999) Adel BouhoulaA New Procedure for Simultaneously Checking Completeness and Ground Confluence
00AC32 (1999) Adel Bouhoula [France]Simultaneous Checking of Completeness and Ground Confluence
00AD67 (1999) Adel Bouhoula [France]A New Procedure for Simultaneously Checking Completeness and Ground Confluence
00B038 (1998) Didier Galmiche ; Dominique Larchey-WendlingFrom ordered monoids to quantales and Petri nets : completeness results revisited in Intuitionistic Linear Logic
00E192 (1988) M. RusinowitchTheorem-proving with Resolution and Superposition : An Extension of Knuth and Bendix Procedure as a Complete Set of Inference Rules.
00E490 (1987) M. RusinowitchTheorem-proving with resolution and superposition : an extension of Knuth and Bendix procedure as a complete set of inference rules
00E949 (1985) E. Kounalis ; H. ZhangTesting completeness of conditional specifications
00E973 (1985) E. Kounalis ; H. ZhangA general completeness test for equational specifications
00E982 (1985) E. KounalisCompleteness in data type specifications

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/KwdEn.i -k "completeness" 

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