Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions

Authors:
Guy Perrier
Affiliations:
-
Venue:
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Year:
2001

Citing 5
Cited 2

Linear logic

Theoretical Computer Science
Using descriptions of trees in a tree adjoining grammar

Computational Linguistics
On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks

LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
D-tree grammars

ACL '95 Proceedings of the 33rd annual meeting on Association for Computational Linguistics
Interaction Grammars

COLING '00 Proceedings of the 18th conference on Computational linguistics - Volume 2

Interaction Grammars

Research on Language and Computation
Term graphs and the NP-completeness of the product-free lambek calculus

FG'09 Proceedings of the 14th international conference on Formal grammar

Quantified Score

Hi-index	0.00

Visualization

Abstract

Given an intuitionistic proof net of linear logic, we abstract an order between its atomic formulas. From this order, we represent intuitionistic multiplicative proof nets in the more compact form of models of directed acyclic graph descriptions. If we restrict the logical framework to the implicative fragment of intuitionistic linear logic, we show that proof nets reduce to models of tree descriptions.