<?xml version="1.0" standalone="yes"?>
<Paper uid="C94-2181">
  <Title>CONSEQUENCE RELATIONS IN DRT</Title>
  <Section position="7" start_page="1116" end_page="1116" type="concl">
    <SectionTitle>
5. Conclusions
</SectionTitle>
    <Paragraph position="0"> We have studied a proof-theoretic foundation for DRT based on consequence relations defined by partial semantics. These consequence relations yield alternative versions of DRT to be used for different applications. We have noted some connections between these relations and partial logics, in particular three-valued and four-valued logics. We believe that the significance of our work lies in reformulating DRT in sequent calculi to be easily applied to computational linguistics.</Paragraph>
    <Paragraph position="1"> There are several topics that can be further developed. First, we should give a more detailed discussion of what sort of completeness proof is involved, although we have established some correspondence results. Second, it is very interesting to show how the proposed consequence relations affect DRT in mo~e detailed ways. Third, we need to extend the present work for the predicate case to take care to capture the dynamic effect of the quantificational structure of DRT.</Paragraph>
  </Section>
class="xml-element"></Paper>