<?xml version="1.0" standalone="yes"?>
<Paper uid="C00-2091">
  <Title>Generation, Lambek Calculus, Montague's Semantics and Semantic Proof Nets</Title>
  <Section position="7" start_page="632" end_page="632" type="concl">
    <SectionTitle>
6 Conclusion
</SectionTitle>
    <Paragraph position="0"> We showed that the problem of generation in the Lambek calculus fi-amework is decidable, and we relied on selnantic proof nets to express it as a guided proof search. On top of keeping the decidability property of this framework, we characterized the semantic proof nets that euable a polynomial time processing.</Paragraph>
    <Paragraph position="1"> Nevertheless, some work remains: we should soon work on the atom numbering and the choice of the lexical items to enable a practical ilnplementation of this work. Moreover, we want to benefit from the power of linear logic (and modalities) to deal with non linear A-terms.</Paragraph>
    <Paragraph position="2"> Finally, since different extensions of Lambek calculus based on proof nets (Moortgat, 1996; Lecomte and Retord, 1995) have been considered, we hope our proposal and its good properties to apply to other linguistic approaches.</Paragraph>
  </Section>
class="xml-element"></Paper>