Connection proof search methods in Linear Logic and proof nets construction

Didier Galmiche 1
1 TYPES - Logic, proof Theory and Programming
LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we present proof search methods related with matrix (or connection) characterization of provability for fragments of Linear Logic (LL) and their relationships with automated proof and proof net construction. Non-classical logics as intuitionistic and linear logics are used in various branches of computer science and in many of these applications automated proof methods are needed. In LL the notion of proof net provides a nice, graphical representation of proofs (without some syntactical bureaucracy) and some works emphasized, for instance, the importance of proof nets to analyze evaluation strategies for proof normalization (and thus for computation) taking into account some concurrency and parallelism. We propose here a based on connection characterization of Multiplicative Linear Logic (MLL) and consequently a connection based proof search method that has the nice property to simultaneously construct a proof net (and also a sequent proof) which can be useful within proof environments. From these results, we expect to consider provability and proof nets construction in other LL fragments that are logical foundations of type-theoretic languages.
Type de document :
Article dans une revue
Theoretical Computer Science, Elsevier, 1998, 30 p
Liste complète des métadonnées

https://hal.inria.fr/inria-00098601
Contributeur : Publications Loria <>
Soumis le : lundi 25 septembre 2006 - 17:03:53
Dernière modification le : jeudi 17 mai 2018 - 12:52:03

Identifiants

  • HAL Id : inria-00098601, version 1

Collections

Citation

Didier Galmiche. Connection proof search methods in Linear Logic and proof nets construction. Theoretical Computer Science, Elsevier, 1998, 30 p. 〈inria-00098601〉

Partager

Métriques

Consultations de la notice

149