Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic for Programming Artificial Intelligence and Reasoning

LPAR 2000: Logic for Programming and Automated Reasoning pp 257–274Cite as

Proof-Search in Implicative Linear Logic as a Matching Problem

  • Conference paper
  • First Online:

  • 368 Accesses

Part of the book series: Lecture Notes in Artificial Intelligence ((LNAI,volume 1955))

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Aarts and K. Trautwein. Non-associative Lambek categorial grammar in polynomial time. Mathematical Logic Quaterly, 41:476–484, 1995. 257, 267

    Article  MATH  MathSciNet  Google Scholar 

  2. C. Berge. Graphs. North-Holland, second revised edition edition, 1985. 260

    Google Scholar 

  3. V. Danos. Une application de la logique linéaire à l'étude des processus de normalisation et principalement du lambda calcul. Thèse de doctorat, Université de Paris VII, 1990. 260

    Google Scholar 

  4. V. Danos and L. Regnier. The structure of multiplicatives. Archive for Mathematical Logic, 28:181–203, 1989. 260, 260

    Article  MATH  MathSciNet  Google Scholar 

  5. Ph. de Groote. An algebraic correctness criterion for intuitionistic multiplicative proofnets. Theoretical Computer Science, 224:115–134, 1999. 260, 262, 262

    Article  MATH  MathSciNet  Google Scholar 

  6. Ph. de Groote. The non-associative lambek calculus with product in polynomial time. In International Conference on Theorem Proving with Analytic Tableaux and Related Methods, volume 1617 of Lecture Notes in Artificial Intelligence, pages 128–139. Springer Verlag, 1999. 257

    Google Scholar 

  7. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987. 257, 258, 260, 260

    Google Scholar 

  8. S. Guerrini. Correctness of multiplicative proof-nets is linear. In Proceedings of the fourteenth annual IEEE symposium on logic in computer science, pages 454–463, 1999. 260

    Google Scholar 

  9. M. Kanovich. Horn programming in linear logic is np-complete. In 7-th annual IEEE Symposium on Logic in Computer Science, pages 200–210. IEEE Computer Society Press, 1992. 257, 266

    Google Scholar 

  10. Yves Lafont. From proof nets to interaction nets. In J.-Y. Girard, Y. Lafont, and L. Regnier, editors, Advances in Linear Logic, pages 225–247. Cambridge University Press, 1995. 260

    Google Scholar 

  11. F. Lamarche. Games semantics for full propositional linear logic. In Ninth Annual IEEE Symposium on Logic in Computer Science. IEEE Press, 1995. 273

    Google Scholar 

  12. F. Lamarche and C. Retoré. Proof nets for the Lambek calculus. In M. Abrusci and C. Casadio, editors, Proofs and Linguistic Categories, Proceedings 1996 Roma Workshop. Cooperativa Libraria Universitaria Editrice Bologna, 1996. 260

    Google Scholar 

  13. J. Lambek. The mathematics of sentence structure. Amer. Math. Monthly, 65:154–170, 1958. 257, 258

    Article  MATH  MathSciNet  Google Scholar 

  14. J. Lambek. On the calculus of syntactic types. In Studies of Language and its Mathematical Aspects, pages 166–178, Providence, 1961. Proc. of the 12th Symp. Appl. Math.. 257, 258

    Google Scholar 

  15. P. Lincoln and T. Winkler. Constant-only multiplicative linear logic is NP-complete. Theoretical Computer Science, 135:155–169, 1994. 266

    Article  MATH  MathSciNet  Google Scholar 

  16. H. Mantel and J. Otten. linTAP: A tableau pover for linear logic. In International Conference on Theorem Proving with Analytic Tableaux and Related Methods, volume 1617 of Lecture Notes in Artificial Intelligence, pages 217–231. Springer Verlag, 1999. 273

    Google Scholar 

  17. M. Moortgat. Categorial type logic. In J. van Benthem and A. ter Meulen, editors, Handbook of Logic and Language, chapter 2. Elsevier, 1997. 257

    Google Scholar 

  18. G. Morrill. Type Logical Grammar: Categorial Logic of Signs. Kluwer Academic Publishers, Dordrecht, 1994. 257

    Google Scholar 

  19. M. Okada. A graph-theoretic characterization theorem for multiplicative fragment of non-commutative linear logic. Electronic Notes on Theoretical Computer Science, 3, 1996. 260

    Google Scholar 

  20. M. Pentus. Language completeness of the Lambek calculus. In Proceedings of the ninth annual IEEE symposium on logic in computer science, pages 487–496, 1994. 258

    Google Scholar 

  21. C. Retoré. Calcul de Lambek et logique linéaire. Traitement Automatique des Langues, 37(2):39–70, 1997. 260

    Google Scholar 

  22. D. Roorda. Resource Logics: proof-theoretical investigations. PhD thesis, University of Amsterdam, 1991. 258, 260, 262

    Google Scholar 

  23. T. Tammet. Proof strategies in linear logic. Journal of Automated Reasoning, 12:273–304, 1994. 273

    Article  MATH  MathSciNet  Google Scholar 

  24. J. van Benthem. Language in action: Categories, Lambdas and Dynamic Logic, volume 130 of Sudies in Logic and the foundation of mathematics. North-Holland, Amsterdam, 1991. 257

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LORIA UMR n° 7503, INRIA Campus Scientifique, B.P. 239, 54506, Vandœuvre lès Nancy Cedex, France

    Philippe de Groote

Authors
  1. Philippe de Groote
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CNRS, Université de Paris 7, case 7012, 2 place Jussieu, 75251, Paris Cedex 05, France

    Michel Parigot

  2. Computer Science Department, University of Manchester, Oxford Rd, M13 9PL, Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Groote, P. (2000). Proof-Search in Implicative Linear Logic as a Matching Problem. In: Parigot, M., Voronkov, A. (eds) Logic for Programming and Automated Reasoning. LPAR 2000. Lecture Notes in Artificial Intelligence(), vol 1955. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44404-1_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-44404-1_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41285-4

  • Online ISBN: 978-3-540-44404-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation