<?xml version="1.0" standalone="yes"?>
<Paper uid="P84-1030">
  <Title>Mays, Eric. &amp;quot;Correcting Misconceptions About Data</Title>
  <Section position="2" start_page="0" end_page="0" type="intro">
    <SectionTitle>
ABSTRACT
</SectionTitle>
    <Paragraph position="0"> Problem localization Is the identification of the most slgnlflcant failures in the AND-OR tree resulting from an unsuocass/ul attempt to achieve a goal, for instance, In planning, backward-chnining inference, or top-down parnin~ We examine beurlstics and strategies for problem localization in the context of using a planner to check for pragmatic failures in natural language input to computer systems, such as a cooperative natural language interface to Unix ** . Our heuristics call for selecting the most hopeful branch at ORs, but the most problematic one at ANDs. Surprise scores and speclal-purpose rules are the maln strategies suggested to determine this.</Paragraph>
  </Section>
class="xml-element"></Paper>