Abstract
Linear Logic [4] has raised a lot of interest in computer research, especially because of its resource sensitive nature. One line of research studies proof construction procedures and their interpretation as computational models, in the “Logic Programming” tradition. An efficient proof search procedure, based on a proof normalization result called “Focusing”, has been described in [2]. Focusing is described in terms of the sequent system of commutative Linear Logic, which it refines in two steps. It is shown here that Focusing can also be interpreted in the proof-net formalism, where it appears, at least in the multiplicative fragment, to be a simple refinement of the “Splitting lemma” for proof-nets. This change of perspective allows to generalize the Focusing result to (the multiplicative fragment of) any logic where the “Splitting lemma” holds. This is, in particular, the case of the Non-Commutative logic of [1], and all the computational exploitation of Focusing which has been performed in the commutative case can thus be revised and adapted to the non commutative case.
This work was performed while the second author was visiting XRCE; this visit was supported by the European TMR (Training and Mobility for Researchers) Network “Linear Logic in Computer Science” (esp. the Rome and Marseille sites, XRCE being attached to the latter).
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
M. Abrusci and P. Ruet. Non commutative logic I: the multiplicative fragment, 1998. to appear in the Annals of Pure and Applied Logic.
J-M. Andreoli. Logic programming with focusing proofs in linear logic. Journal of Logic and Computation, 2(3), 1992.
J-M. Andreoli and R. Pareschi. LO and behold! concurrent structured processes. In Proc. of OOPSLA/ECOOP’90, Ottawa, Canada, 1990.
J-Y. Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.
J-Y. Girard. On the meaning of logical rules I: syntax vs. semantics II: multiplicatives and additives, 1998. Preprint.
J-Y. Girard. Informal communication, 1999. presented at the TMR “Linear” workshop on Non-commutative Logic, Prascati, April 1999.
J.S. Hodas and D. Miller. Logic programming in a fragment of intuitionistic linear logic. Journal of Information and Computation, 110(2):327–365, 1994.
D. Miller. Lexical scoping as universal quantification. In Proc. of the 6th International Conference on Logic Programming, Lisboa, Portugal, 1989.
D. Miller. Forum: A multiple-conclusion specification logic. Theoretical Computer Science, 165(1):201–232, 1996.
D. Miller, G. Nadathur, F. Pfenning, and A. Scedrov. Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic, 51:125–157, 1991.
C. Retoré. Pomset logic: A non-commutative extension of classical linear logic. In Proc. of TLCA’ 97, pages 300–318, Nancy, France, 1997.
P. Ruet. Non commutative logic II: Sequent calculus and phase semantics, 1998. Preprint.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Andreoli, JM., Maieli, R. (1999). Focusing and Proof-Nets in Linear and Non-commutative Logic. In: Ganzinger, H., McAllester, D., Voronkov, A. (eds) Logic for Programming and Automated Reasoning. LPAR 1999. Lecture Notes in Computer Science(), vol 1705. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48242-3_20
Download citation
DOI: https://doi.org/10.1007/3-540-48242-3_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66492-5
Online ISBN: 978-3-540-48242-0
eBook Packages: Springer Book Archive