PascalFr.i
Exploration
Accueil
Racine
Exploration
Accueil
Racine

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

Index « PascalFr.i » - entrée « Complétude »
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.
Complétion < Complétude < Compléxité implicite  Facettes :

List of bibliographic references indexed by Complétude

Number of relevant bibliographic references: 15.
Ident.Authors (with country if any)Title
002802 (2011) Didier Galmiche [France] ; Yakoub Salhi [France]Sequent calculi and decidability for intuitionistic hybrid logic
002805 (2011) Isabelle Gnaedig [France] ; Hélène Kirchner [France]Proving weak properties of rewriting
002817 (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
004452 (2008) Elias P. Tsigaridas [France] ; Ioannis Z. Emiris [Grèce]On the complexity of real root isolation using continued fractions
005618 (2006) Guillaume Burel [France] ; Claude Kirchner [France]Completion Is an Instance of Abstract Canonical System Inference
006B71 (2004) Johanne Cohen [France] ; Emmanuel Jeannot [France] ; Nicolas Padoy [France]Messages Scheduling for Data Redistribution between Clusters
006B91 (2004) Philippe De Groote [France] ; Sylvain Salvati [France]Higher-Order Matching in the Linear λ -calculus with Pairing
006D01 (2004) A. S. Murawski [Royaume-Uni] ; C.-H. L. Ong [Royaume-Uni]On an interpretation of safe recursion in light affine logic
007984 (2003) Harald Ganzinger [Allemagne] ; Jürgen Stuber [France]Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation
007A33 (2003) Christophe Ringeissen [France]Matching in a Class of Combined Non-disjoint Theories
008832 (2002) Gilles Dowek [France] ; Thérèse Hardin [France] ; Claude Kirchner [France]Binding Logic: Proofs and Models
009397 (2001) Jürgen Stuber [France]A Model-Based Completeness Proof of Extended Narrowing and Resolution
009D11 (2000) Adel Bouhoula [États-Unis, France] ; Jean-Pierre Jouannaud [France] ; José Meseguer [États-Unis]Specification and proof in membership equational logic
009D56 (2000) D. Galmiche [France]Connection methods in linear logic and proof nets construction
00BF30 (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/Main/Exploration

HfdIndexSelect -h $EXPLOR_AREA/Data/Main/Exploration/PascalFr.i -k "Complétude" 

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