<?xml version="1.0" standalone="yes"?>
<Paper uid="E93-1008">
  <Title>Disjunctions and Inheritance in the Context Feature Structure System</Title>
  <Section position="7" start_page="58" end_page="58" type="concl">
    <SectionTitle>
5 Conclusion
</SectionTitle>
    <Paragraph position="0"> For the tasks outlined in the first part, the efficient treatment of disjunctions and inheritance, we introduced contexts. Contexts have been defined on the basis of a set theoretic semantics for CFS feature structures, such that they describe the space of possible unification conflicts adequately. The unification formalism of CFS computes a set of nogood contexts, from which the algorithm outlined in the third part computes the border of most general nogood contexts, which is also important for inspection and output. Clearly we cannot find a polynomial algorithm for an exponential problem (number of possible nogoods), but by elaborated techniques we can reduce the effort exponentially in order to get usable systems in the practical case.</Paragraph>
  </Section>
class="xml-element"></Paper>