Proof-search in implicative linear logic as a matching problem

Philippe De Groote 1
1 CALLIGRAMME - Linear logic, proof networks and categorial grammars
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : We reduce the provability of fragments of multiplicative linear logic to matching problems consisting in finding a one-one-correspondence between two sets of first-order terms together with a unifier that equates the corresponding terms. According to the kind of structure to which these first-order terms belong our matching problem corresponds to provability in the implicative fragment of multiplicative linear logic, in the Lambek calculus, or in the non-associative Lambek calculus.
Type de document :
Communication dans un congrès
Michel Parigot, Andrei Voronkov. International Conference on Logic for Programming & Automated Reasoning - LPAR'2000, 2000, Reunion Island, France, Springer, 1955, pp.257-274, 2000, Lecture Notes in Artificial Intelligence
Liste complète des métadonnées

https://hal.inria.fr/inria-00099221
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 08:51:57
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00099221, version 1

Collections

Citation

Philippe De Groote. Proof-search in implicative linear logic as a matching problem. Michel Parigot, Andrei Voronkov. International Conference on Logic for Programming & Automated Reasoning - LPAR'2000, 2000, Reunion Island, France, Springer, 1955, pp.257-274, 2000, Lecture Notes in Artificial Intelligence. 〈inria-00099221〉

Partager

Métriques

Consultations de la notice

88