<?xml version="1.0" standalone="yes"?>
<Paper uid="A00-2010">
  <Title>Generation in the Lambek Calculus Framework: an Approach with Semantic Proof Nets</Title>
  <Section position="5" start_page="76" end_page="76" type="concl">
    <SectionTitle>
6 Conclusion
</SectionTitle>
    <Paragraph position="0"> We took advantage of proof nets on the semantic point of view and we expressed the generation process as a guided proof search. On top of keeping the decidability property of this framework, we characterized the semantic proof nets that enable a polynomial time process.</Paragraph>
    <Paragraph position="1"> Such properties are crucial because it is the central part of the generation process (considering Lambek calculus).</Paragraph>
    <Paragraph position="2"> But there are other things left to look at. As the very next steps, we should work on the atoms numbering and the choice of the lexical items. Appropriate interactions between word order contraints and matrix resolution in the hard case should also be considered. Moreover, another point is to benefit from the power of linear logic and deal with non linear A-terms.</Paragraph>
    <Paragraph position="3"> Finally. since different extensions of Lambek calculus based on proof nets (Moortgat, 1996; Lecomte and Retor6, 1995) have been considered, we hope our proposal and its good properties to apply to other linguistic approaches.</Paragraph>
  </Section>
class="xml-element"></Paper>