Keywords
Checkpoint
PascalFrancis
Racine
Checkpoint
PascalFrancis
Exploration
Accueil
Racine
Racine

Serveur d'exploration sur la recherche en informatique en Lorraine - Checkpoint (PascalFrancis)

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 set of unifiers < Completeness < Completion  Facettes :

List of bibliographic references

Number of relevant bibliographic references: 15.
Ident.Authors (with country if any)Title
000122 (2011) Didier Galmiche [France] ; Yakoub Salhi [France]Sequent calculi and decidability for intuitionistic hybrid logic
000125 (2011) Isabelle Gnaedig [France] ; Hélène Kirchner [France]Proving weak properties of rewriting
000140 (2011) Khaled Gaaloul [Luxembourg (pays)] ; H. A. Proper [Luxembourg (pays)] ; Ehtesham Zahoor [France] ; François Charoy [France] ; Claude Godart [France]A logical framework for reasoning about delegation policies in workflow management systems
000271 (2008) Elias P. Tsigaridas [France] ; Ioannis Z. Emiris [Grèce]On the complexity of real root isolation using continued fractions
000403 (2006) Guillaume Burel [France] ; Claude Kirchner [France]Completion Is an Instance of Abstract Canonical System Inference
000586 (2004) A. S. Murawski [Royaume-Uni] ; C.-H. L. Ong [Royaume-Uni]On an interpretation of safe recursion in light affine logic
000592 (2004) Johanne Cohen [France] ; Emmanuel Jeannot [France] ; Nicolas Padoy [France]Messages scheduling for data redistribution between clusters
000599 (2004) Philippe De Groote [France] ; Sylvain Salvati [France]Higher-order matching in the linear λ-calculus with pairing
000672 (2003) Harald Ganzinger [Allemagne] ; Jürgen Stuber [France]Superposition with equivalence reasoning and delayed clause normal form transformation
000690 (2003) Christophe Ringeissen [France]Matching in a class of combined non-disjoint theories
000827 (2002) Gilles Dowek [France] ; Thérèse Hardin [France] ; Claude Kirchner [France]Binding logic: Proofs and models
000925 (2001) Jürgen Stuber [France]A model-based completeness proof of extended narrowing and Resolution
000969 (2000) A. Bouhoula [États-Unis, France] ; J.-P. Jouannaud [France] ; J. Meseguer [États-Unis]Specification and proof in membership equational logic
000A16 (2000) D. Galmiche [France]Connection methods in linear logic and proof nets construction
000C73 (1996) A. 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/PascalFrancis/Checkpoint

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/KwdEn.i -k "Completeness" 

HfdIndexSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/KwdEn.i  \
                -Sk "Completeness" \
         | HfdSelect -Kh $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Wicri/Lorraine
   |area=    InforLorV4
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |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