<?xml version="1.0" standalone="yes"?>
<Paper uid="C92-1020">
  <Title>On the Satisfiability of Complex Constraints</Title>
  <Section position="5" start_page="0" end_page="0" type="concl">
    <SectionTitle>
5 Conclusions
</SectionTitle>
    <Paragraph position="0"> Tim strategy for handling complex constraints described in this paper has I)een successfully put to use in ditl~rent CLG implementations.</Paragraph>
    <Paragraph position="1"> One of the adwmtagcs of using a rewrite sys- \[I\[cr30\] tcm is that it is easily extended to other atomic constraints like the ones in CLG(2) dealing with lists. Similarly it can bc adapted to cope with the extensions to feature constraints proposed \[Job91\] in \[Joh9i\].</Paragraph>
    <Paragraph position="2"> AcrEs DE COLING-92, NANTES, 23-28 AO't~T 1992 1 1 2 PROC. OF COLING-92, NANTES, AUO. 23-28, 1992 AcrEs DE COL1NG-92, NANTES, 23-28 AOI~'I' 1992 1 1 1 PROC. OF COLING-92. NANTI':S. AUG. 23-28. 1992</Paragraph>
  </Section>
class="xml-element"></Paper>