We show how the limited
<term>
semantic expressibility
</term>
of
<term>
CTL
</term>
can be exploited to derive a hierarchy of
<term>
subsets
</term>
.
#30980We show how the limited semantic expressibility of CTL can be exploited to derive a hierarchy of subsets .
other,28-4-P99-1058,ak
Our strategy avoids potential difficulties with approaches that take existing
<term>
computational semantic analyses
</term>
of
<term>
English
</term>
as their starting point -- such as the need to ensure that all
<term>
sentences
</term>
in the
<term>
subset
</term>
possess a
<term>
CTL translation
</term>
.
#31010Our strategy avoids potential difficulties with approaches that take existing computational semantic analyses of English as their starting point--such as the need to ensure that all sentences in the subset possess a CTL translation.
