Abstract : We present a proof-theoretic foundation for automated deduction in linear logic. At first, we systematically study the permutability properties of the
inference rules in this logical framework and exploit these to introduce an appropriate notion of forward and backward movement of an inference in a
proof. Then we discuss the naturally-arising question of the redundancy reduction and investigate the definition of the normal proof concept.
We briefly consider some of the issues related to proof construction mechanization in linear logic and to the design of logic programming languages from linear logic fragments.
https://hal.inria.fr/hal-01297755
Contributeur : Guy Perrier
<>
Soumis le : lundi 4 avril 2016 - 17:42:32
Dernière modification le : mardi 17 avril 2018 - 11:48:04
Document(s) archivé(s) le : lundi 14 novembre 2016 - 15:59:00
