<?xml version="1.0" standalone="yes"?>
<Paper uid="E89-1028">
  <Title>COMPUTATIONAL SEMANTICS OF MASS TERMS</Title>
  <Section position="10" start_page="0" end_page="0" type="concl">
    <SectionTitle>
CONCLUSION
</SectionTitle>
    <Paragraph position="0"> We have here presented a computational approach to the semantics of quantified mass noun phrases. We think the semantics ascribed to quantified mass - 210nouns through a translation into LM is the one that most adequately reflects their particular semantic properties. In addition this semantics can be made computational in a way not possible for other approaches to the semantics of mass terms, like Bum's (1985) which extends axiomatic set theory, or Link's approach (1983) based on Montague's higher-order intensional logic.</Paragraph>
    <Paragraph position="1"> We have modified and adapted a tableau calculus to be used with mass terms and extended it with generalized quantifiers. Although the implementation we have made is of limited applicability, we hope that the algorithm can be used to incorporate quantified mass noun phrases into larger systems treating count terms. In particular, it should be possible to combine the algorithm with other approaches based on a tableau calculus, like the one described by Guenthner, Lehmann and SchOnfeld (1986).</Paragraph>
  </Section>
class="xml-element"></Paper>