Two Theories for Computing the Logical Form of Mass Expressions

Anthology ID:: P84-1025
Volume:: 10th International Conference on Computational Linguistics and 22nd Annual Meeting of the Association for Computational Linguistics
Month:: July
Year:: 1984
Address:: Stanford, California, USA
Venues:: COLING | ACL
SIG:
Publisher:: Association for Computational Linguistics
Note:
Pages:: 108–111
Language:
URL:: https://preview.aclanthology.org/remove-affiliations/P84-1025/
DOI:: 10.3115/980491.980516
Bibkey:
Cite (ACL):: Francis Jeffry Pelletier and Lenhart K. Schubert. 1984. Two Theories for Computing the Logical Form of Mass Expressions. In 10th International Conference on Computational Linguistics and 22nd Annual Meeting of the Association for Computational Linguistics, pages 108–111, Stanford, California, USA. Association for Computational Linguistics.
Cite (Informal):: Two Theories for Computing the Logical Form of Mass Expressions (Pelletier & Schubert, COLING-ACL 1984)
Copy Citation:
PDF:: https://preview.aclanthology.org/remove-affiliations/P84-1025.pdf