Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logical Aspects of Computational Linguistics

LACL 1996: Logical Aspects of Computational Linguistics pp 310–328Cite as

Generation as deduction on labelled proof nets

  • Conference paper
  • First Online:

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

Abstract

In the framework of labelled proof nets the task of parsing in categorial grammar can be reduced to the problem of first-order matching under theory. Here we shall show how to use the same method of labelled proof nets to reduce the task of generating to the problem of higher-order matching.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. V. Danos and L. Regnier. The structure of multiplicatives. Archive for mathematical logic, (28):181–203, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  2. Gilles Dowek. Third order matching is decidable. In 7th Annual IEEE Symposium of Logic in Computer Science, pages 2–10, 1992.

    Google Scholar 

  3. Dov Gabbay. Labelled Deductive Systems. Oxford University Press, 1996.

    Google Scholar 

  4. Jean Gallier and Wayne Snyder. Designing unification procedures using transformations: a survey. In Workshop Logic For Computer Science. MSRI Berkeley, 1989.

    Google Scholar 

  5. Jean-Yves Girard. Linear logic. Theoretical Computer Science, 50(1):1–102, 1987.

    Article  MATH  MathSciNet  Google Scholar 

  6. W. Goldfard. The undecibility of the second-order unification problem. Theoretical Computer Science, 13(2):225–230, 1981.

    Article  MathSciNet  Google Scholar 

  7. G. Huet. Constrained Resolution: A Complete Method for Higher-Order Logic. PhD thesis, Case Western Reserve University, 1972.

    Google Scholar 

  8. G. Huet. A unification algorithm for typed λ-calculus. Theoretical Computer Science, 1(1):27–57, 1975.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. Lambek. The mathematics of sentence structure. American Mathematical Monthly, (65): 154–170, 1958.

    Article  MathSciNet  MATH  Google Scholar 

  10. Jordi Levy. Linear second-order unification. Rewriting Techniques and Applications, 1996.

    Google Scholar 

  11. Xavier Lloré and Glyn Morrill. Difference lists and difference bags for logic programming of categorial deduction. In Proceedings of the Sociedad Espanola para el Procesamiento del Lenguaje Natural, pages 115–129, 1995.

    Google Scholar 

  12. Michael Moortgat. Labelled deductive systems for categorial theorem proving. In Proceedings Eight Amsterdam Colloquium, pages 403–424, Amsterdam, 1992. Institute of Language, Logic and Information, Universiteit van Amsterdam.

    Google Scholar 

  13. Glyn Morrill. Type Logical Grammar: Categorial Logic of Signs. Kluwer Academic Publishers, 1994.

    Google Scholar 

  14. Glyn Morrill. Clausal proofs and discontinuity. Bulletin of the Interest Group in Pure and Applied Logics, 3(2–3):403–427, 1995.

    MATH  MathSciNet  Google Scholar 

  15. Glyn Morrill. Higher-order linear logic programming of categorial deduction. In Proceedings ACL, pages 133–140, 1995.

    Google Scholar 

  16. Glyn Morrill. Memoisation of categorial proof nets: parallelism in categorial processing. In Michele Abrusci and Claudia Casadio, editors, Proof and Linguistic Categories: Proceedings 1996 Roma Workshop, pages 157–169. Università di Bologna, 1996. To appear in S. Manandhar, W. Nutt and G. Lopez (eds.), Springer-Verlag.

    Google Scholar 

  17. F. Pereira and D. Warren. Parsing as deduction. In Proceedings ACL, pages 132–144, 1983.

    Google Scholar 

  18. Dirk Roorda. Resource Logics: Proof-theoretical Investigations. PhD thesis, Universiteit van Amsterdam, 1991.

    Google Scholar 

  19. Wayne Snyder and Jean Gallier. Higher-order unification revisited: Complete sets of transformations. Journal of Symbolic Computation, (8): 101–140, 1989.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departement de Llenguatges i Sistemes Informátics, Universität Politècnica de Catalunya, Campus Nord Jordi Girona Salgado, 1-3, E-08034, Barcelona

    Josep M. Merenciano & Glyn Morrill

Authors
  1. Josep M. Merenciano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Glyn Morrill
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Retoré

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Merenciano, J.M., Morrill, G. (1997). Generation as deduction on labelled proof nets. In: Retoré, C. (eds) Logical Aspects of Computational Linguistics. LACL 1996. Lecture Notes in Computer Science, vol 1328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052164

Download citation

  • DOI: https://doi.org/10.1007/BFb0052164

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69631-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation