<?xml version="1.0" standalone="yes"?>
<Paper uid="P91-1005">
  <Title>AN ALGORITHM FOR PLAN RECOGNITION IN COLLABORATIVE DISCOURSE*</Title>
  <Section position="11" start_page="37" end_page="37" type="concl">
    <SectionTitle>
CONCLUSIONS ~ FUTURE DIRECTIONS
</SectionTitle>
    <Paragraph position="0"> To achieve their joint goal, collaborating agents must have mutual beliefs about the types of actions they will perform to achieve that goal, the relations among those actions, the agents who will perform the actions, and the time interval over which they will do so. In this paper, we have presented a representation, augmented rgraphs, modelling this information and have provided an algorithm for constructing and reasoning with it.</Paragraph>
    <Paragraph position="1"> The steps of the construction algorithm parallel the reasoning that an agent performs in determining the relevance of an activity. The algorithm does not require that activities be discussed in a fixed order and allows for reasoning about hypothetical or only partially specified activities.</Paragraph>
    <Paragraph position="2"> Future work includes: (1) adding other types of constraints (e.g. restrictions on the parameters of actions) to the representation; (2) using the augmented rgraph representation in identifying, on the basis of unsatisfiable constraints, particular discrepancies in the agents' beliefs; (3) identifying information conveyed in Gi's utterances as to how he believes two acts are related (Balkanski, 1991) and incorporating that information into our model of Gj's reasoning.</Paragraph>
  </Section>
class="xml-element"></Paper>