<?xml version="1.0" standalone="yes"?>
<Paper uid="E95-1023">
  <Title>Deterministic Consistency Checking of LP Constraints</Title>
  <Section position="8" start_page="171" end_page="171" type="concl">
    <SectionTitle>
8 Conclusions
</SectionTitle>
    <Paragraph position="0"> We have shown that the logic of linear precedence can be handled elegantly and deterministically by adding new logical primitives to feature logic. Although, theoretically speaking, our logic comes with some restrictions these have no practical consequences whatsoever. Our implementation of the logic as an extension to the ProFIT typed feature formalism shows that a reasonably efficient implementation is feasible. Some further work is necessary to determine the computational complexity of our constraint solving procedure. However, we believe that it is polynomial.</Paragraph>
    <Paragraph position="1"> The logic presented in this paper generalises the approach taken in (Reape, 1993). Our approach demonstrates that it is not necessary to employ a non-deterministic operation such as domain union to manipulate domains. Instead precedence constraints are directly embedded in feature logic and a deterministic constraint solving procedure is provided. A wide range of constraints involving precedence is provided directly in feature logic ranging from constraints expressing precedence between variables, precedence between domains to guards on precedence constraints.</Paragraph>
  </Section>
class="xml-element"></Paper>