Proof nets Construction and Automated Deduction in Non-commutative Linear Logic - extended abstract - - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Electronic Notes in Theoretical Computer Science Année : 1998

Proof nets Construction and Automated Deduction in Non-commutative Linear Logic - extended abstract -

Didier Galmiche
Bruno Martin

Résumé

This paper presents an algorithm for automated proof nets construction in the non-commutative multiplicative linear logic (NCMLL) that is a logic useful for applications as planning, concurrency or sequentiality. The properties of this algorithm can be proved from a recently defined graph-theoretic characterization of non-commutative proof nets. Involving simple construction principles improved in the commutative case, it induces also a new proof search method for NCMLL. Moreover the relationships between non-commutative linear logic and Lambek calculus lead to a new method for automatic construction of proof nets for this calculus.
Fichier non déposé

Dates et versions

inria-00098604 , version 1 (25-09-2006)

Identifiants

  • HAL Id : inria-00098604 , version 1

Citer

Didier Galmiche, Bruno Martin. Proof nets Construction and Automated Deduction in Non-commutative Linear Logic - extended abstract -. Electronic Notes in Theoretical Computer Science, 1998, 17, pp.1-20. ⟨inria-00098604⟩
45 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More