<?xml version="1.0" standalone="yes"?>
<Paper uid="P90-1013">
  <Title>THE COMPUTATIONAL COMPLEXITY OF AVOIDING CONVERSATIONAL IMPLICATURES</Title>
  <Section position="9" start_page="102" end_page="102" type="concl">
    <SectionTitle>
8. Conclusion
</SectionTitle>
    <Paragraph position="0"> Referring expressions and other object descriptions need to be brief, to avoid unnecessary elements, and to use lexically preferred classes; otherwise, they may carry unwanted and incorrect conversational implicatures. These principles can be formalized by requiring referring expressions to be maximal under the Local Brevity, No Unnecessary Components, and 104 Lexical Preference preference rules. These preference rules can be incorporated into a polynomial-time algorithm for generating free-of-false-implicatures referring expressions, while some alternative preference rules (Full Brevity and No Unnecessary Words) make this generation task NPHard. null</Paragraph>
  </Section>
class="xml-element"></Paper>