Proof nets Construction and Automated Deduction in Non-commutative Linear Logic - extended abstract - - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Electronic Notes in Theoretical Computer Science Year : 1998

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

Didier Galmiche
Bruno Martin

Abstract

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.
No file

Dates and versions

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

Identifiers

  • HAL Id : inria-00098604 , version 1

Cite

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⟩
43 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More