<?xml version="1.0" standalone="yes"?>
<Paper uid="P00-1047">
  <Title>A Polynomial-Time Fragment of Dominance Constraints</Title>
  <Section position="1" start_page="0" end_page="0" type="abstr">
    <SectionTitle>
Abstract
</SectionTitle>
    <Paragraph position="0"> Dominance constraints are logical descriptions of trees that are widely used in computational linguistics.</Paragraph>
    <Paragraph position="1"> Their general satis ability problem is known to be NP-complete. Here we identify the natural fragment of normal dominance constraints and show that its satis ability problem is in deterministic polynomial time.</Paragraph>
  </Section>
class="xml-element"></Paper>