Skip to main content
SpringerLink
Log in
Book cover

International Conference on Automated Deduction

CADE 1999: Automated Deduction — CADE-16 pp 1–15Cite as

A Dynamic Programming Approach to Categorial Deduction

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1632))

Abstract

We reduce the provability problem of any formula of the Lambek calculus to some context-free parsing problem. This reduction, which is based on non-commutative proof-net theory, allows us to de- rive an automatic categorial deduction algorithm akin to the well-known Cocke-Kasami-Younger parsing algorithm.

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. M. Abrusci. Phase semantics and sequent calculus for pure non-commutative classical linear logic. Journal of Symbolic Logic, 56(4):1403–1451, 1991.

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  3. A Fleury. La règle d’échange: logique lineaire multiplicative tressée. Thès de Doctorat, spécialité Mathématiques, Université Paris 7, 1996.

    Google Scholar 

  4. J.-Y. Girard. Linear logic. Theoretical Computer Science, 50:1–102, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  5. J.-Y. Girard. Quantifiers in linear logic II. Technical Report 19, Equipe de Logique Mathématique, Université de Paris VII, 1991.

    Google Scholar 

  6. 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.

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  9. G. Morrill. Memoisation of categorial proof nets: parallelism in categorial processing. In V. M. Abrusci and C. Casadio, editors, Proofs and Linguistic Categories, Proceedings 1996 Roma Workshop. Cooperativa Libraria Universitaria Editrice Bologna, 1996.

    Google Scholar 

  10. D. Roorda. Resource Logics: proof-theoretical investigations. PhD thesis, University of Amsterdam, 1991.

    Google Scholar 

  11. D. N. Yetter. Quantales and (non-commutative) linear logic. Journal of Symbolic Logic, 55:41–64, 1990.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LORIA UMR no 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

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Groote, P. (1999). A Dynamic Programming Approach to Categorial Deduction. In: Automated Deduction — CADE-16. CADE 1999. Lecture Notes in Computer Science(), vol 1632. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48660-7_1

Download citation

  • DOI: https://doi.org/10.1007/3-540-48660-7_1

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66222-8

  • Online ISBN: 978-3-540-48660-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation