Skip to Main content Skip to Navigation
Conference papers

A procedure for automatic proof nets construction

Didier Galmiche 1, 2 Guy Perrier 2, 1 
2 Prograis
INRIA Lorraine, CRIN - Centre de Recherche en Informatique de Nancy
Abstract : In this paper, we consider multiplicative linear logic (MLL) from an automated deduction point of view. Linear logic is more expressive than classical and intuitionistic logic and has an undirectional character due to the particular treatment of negation and the absence of structural rules. Considering this new logical framework to make logic programming or programming with proofs (extracting programs from proofs), a better comprehension of proofs in MLL (proof nets) is necessary and automated deduction has to be studied. Knowing that the multiplicative part of linear logic is decidable, we propose a new algorithm to construct automatically a proof net for a given sequent in MLL with proofs of termination, correctness and completeness. It can be considered as a more direct and implementation oriented way to consider automated deduction in linear logic.
Document type :
Conference papers
Complete list of metadata
Contributor : Guy Perrier Connect in order to contact the contributor
Submitted on : Monday, April 4, 2016 - 5:37:08 PM
Last modification on : Friday, February 4, 2022 - 3:12:33 AM
Long-term archiving on: : Monday, November 14, 2016 - 4:03:43 PM


Files produced by the author(s)


  • HAL Id : hal-01297750, version 1



Didier Galmiche, Guy Perrier. A procedure for automatic proof nets construction. Conference on Logic Programming and Automated Reasoning, LPAR'92, 1992, St-Petersburg, Russia. pp.42-53. ⟨hal-01297750⟩



Record views


Files downloads