Abstract
LINK is a proof environment including proof nets-based provers for multiplicative linear logics: mixed linear logic, or recently called non-commutative logic (MNL) [1], commutative linear logic (MLL) and non-commutative (or cyclic) linear logic (MCyLL). Its main characteristic is the provability analysis through automatic proof nets construction. A proof net is a particular graph-theoretic representation of proofs that appears appropriate for proof-search in MLL and MCyLL [4,5]. It is a powerful alternative to deal with proof search and its problems about non-permutability and resource management [3]. In the context of system verification, such a semantical and graphical representation of proof can be useful from a software engineering point of view. It allows to analyse provability (through proof nets) or non-provability (through proof structures that can be seen as counter-models).
École Normale Supérieure Ulm, Paris, France, in a training period at LORIA.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Abrusci and P. Ruet. Non-commutative logic I: the multiplicative fragment. Annals of Pure and Applied Logic, 101:29–64, 2000.
J.M. Andreoli and R. Maieli. Focusing and proof-nets in linear and non-commutative logic. In Int. Conf. on Logic for Programming and Automated Reasoning, LPAR’99, LNCS 1705, pages 320–333, Tbilisi, Georgia, September 1999.
I. Cervesato, J. Hodas, and F. Pfenning. Efficient resource management for linear logic proof search. Theoretical Computer Science, 232(1–2):133–163, 2000.
D. Galmiche. Connection Methods in Linear Logic and Proof nets Construction. Theoretical Computer Science, 232(1–2):231–272, 2000.
D. Galmiche and B. Martin. Proof nets construction and automated deduction in non-commutative linear logic-extended abstract. Electronic Notes in Theoretical Computer Science, 17, 1998.
D. Galmiche and J.M. Notin. Proof-search and proof nets in mixed linear logic. Electronic Notes in Theoretical Computer Science, 37, 2000.
D. Galmiche and J.M. Notin. Calculi with dependency relations for mixed linear logic. In International Workshop on Logic and Complexity in Computer Science, LCCS’2001, pages 81–102, Créteil, France, 2001.
D. Galmiche and G. Perrier. A procedure for automatic proof nets construction. In LPAR’92, International Conference on Logic Programming and Automated Reasoning, LNAI 624, pages 42–53, St. Petersburg, Russia, July 1992.
D. Gray, G. Hamilton, J. Power, and D. Sinclair. Specifying and verifying TCP/IP using Mixed Intuitionistic Linear Logic. Technical report, Dublin City Univ., 2001.
C. Kreitz, H. Mantel, J. Otten, and S. Schmitt. Connection-based proof construction in linear logic. In 14th Int. Conference on Automated Deduction, pages 207–221, Townsville, North Queensland, Australia, 1997.
V. Mogbil. Quadratic correctness criterion for non commutative logic. In 15th Int. Workshop on Computer Science Logic, CSL 2001, LNCS 2142, pages 69–83, Paris, France, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Habert, L., Notin, JM., Galmiche, D. (2002). LINK: A Proof Environment Based on Proof Nets. In: Egly, U., Fermüller, C.G. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2002. Lecture Notes in Computer Science(), vol 2381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45616-3_23
Download citation
DOI: https://doi.org/10.1007/3-540-45616-3_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43929-5
Online ISBN: 978-3-540-45616-2
eBook Packages: Springer Book Archive