Proof-search in implicative linear logic as a matching problem

Authors:
Philippe de Groote
Affiliations:
LORIA UMR - INRIA, Vandoeuvre lès Nancy Cedex, France
Venue:
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Year:
2000

Citing 6
Cited 0

Linear logic

Theoretical Computer Science
Constant-only multiplicative linear logic is NP-complete

MFPS '92 Selected papers of the conference on Meeting on the mathematical foundations of programming semantics, part I : linear logic: linear logic
From proof-nets to interaction nets

Proceedings of the workshop on Advances in linear logic
An algebraic correctness criterion for intuitionistic multiplicative proof-nets

Theoretical Computer Science
Games Semantics for Full Propositional Linear Logic

LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Correctness of Multiplicative Proof Nets is Linear

LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.