A procedure for automatic proof nets constructionReport as inadecuate

A procedure for automatic proof nets construction - Download this document for free, or read online. Document in PDF available to download.

1 UHP - Université Henri Poincaré - Nancy 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.

Keywords : Linear Logic Proof nets

Author: Didier Galmiche - Guy Perrier -

Source: https://hal.archives-ouvertes.fr/


Related documents