Achieving Expressive Completeness and Computational Efficiency for Underspecified Semantic Representations

Article English OPEN
Lappin, Shalom ; Fox, C (2005)
  • Subject: PHI

Article
  • References (14)
    14 references, page 1 of 2

    Blackburn, P. and Bos, J.: 2005, Representation and Inference for Natural Language, CSLI, Stanford

    Bos, J.: 1995, Predicate logic unplugged, in Proceedings of the Tenth Amsterdam Colloquium, Amsterdam, Holland

    Cooper, R.: 1983, Quantification and Syntactic Theory, Synthese Language Library, D. Reidel, Dordrecht

    Copestake, A., Flickinger, D., and Sag, I. A.: 1997, Minimal Recursion Semantics, Tech. rep., Stanford University, Stanford, CA, unpublished ms.

    Curry, H. B. and Feys, R.: 1958, Combinatory Logic, vol. 1 of Studies in Logic, North Holland

    Ebert, C.: 2005, Formal Investigation of Underspecified Representations, Ph.D. thesis, Department of Computer Science, King's College London, unpublished

    van Eijck, J.: 2003, Computational Semantics and Type Theory, unpublished ms., CWI, Amsterdam

    Fox, C. and Lappin, S.: 2005a, Formal Foundations of Intensional Semantics, Blackwell, Oxford

    Fox, C. and Lappin, S.: 2005b, Underspecified interpretations in a Curry-typed representation language, The Journal of Logic and Computation 15, 131-143

    Fox, C. and Lappin, S.: 2005c, Expressive Completeness and Computational Efficiency for Underspecified Representations, unpublished ms., University of Essex and King's College London

  • Metrics
    No metrics available
Share - Bookmark