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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
P. Blache. “Contraintes et théories linguistiques: des Grammaires d’Unification aux Grammaires de Propriétés”. Thése d’habilitation, Université Paris 7, 1999.
D. Duchier and S. Thater. Parsing with tree descriptions: a constraint based approach. In Natural Language Understanding and Logic Programming NLULP’99,Dec 1999, Las Cruces, New Mexico, 1999.
J.-Y. Girard. Linear logic. Theoretical Computer Science, 50(1):1–102, 1987.
F. Lamarche. Proof Nets for Intuitionistic Linear Logic I: Essential Nets. Preliminary report, Imperial College, April 1994. Available via the URL http://hypatia.dcs.qmw.ac.uk/ .
M. Moortgart. Categorial Type Logics. In J. van Benthem and A. ter Meulen, editors, Handbook of Logic and Language, chapter 2. Elsevier, 1996.
G. Perrier. Interaction grammars. In CoLing’ 2000, Sarrebrücken, 2000.
G. K. Pullum and B. C. Scholz. On the Distinction between Model-Theoretic and Generative-Enumerative Syntactic Frameworks. In P. de Groote, G. Morrill, and C. Retoré, editors, Logical Aspects of Computational Linguistics, LACL 2001, Le Croisic, France, volume 2099 of Lecture Notes in Computer Science, pages 17–43. Springer Verlag, 2001.
C. Retoré. Calcul de lambek et logique linéaire. Traitement Automatique des Langues, 37(2):39–70, 1996.
J. Rogers and K. Vijay-Shanker. Obtaining trees from their descriptions: an application to tree-adjoining grammars. Computational Intelligence, 10(4):401–421, 1994.
O. Rambow, K. Vijay-Shanker, and D. Weir. D-tree grammars. In 33rd Annual Meeting of the Association for Computational Linguistics, pages 151–158, 1995.
K. Vijay-Shanker. Using description of trees in a tree adjoining grammar. Computational Linguistics, 18(4):481–517, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perrier, G. (2001). Intuitionistic Multiplicative Proof Nets as Models of Directed Acyclic Graph Descriptions. In: Nieuwenhuis, R., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2001. Lecture Notes in Computer Science(), vol 2250. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45653-8_16
Download citation
DOI: https://doi.org/10.1007/3-540-45653-8_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42957-9
Online ISBN: 978-3-540-45653-7
eBook Packages: Springer Book Archive