</term>
in place of a
<term>
denotational semantics
#16946Our interpretation differs from that of Pereira and Shieber by using alogical model in place of a denotational semantics.
other,18-6-P86-1038,ak
<term>
logical model
</term>
in place of a
<term>
denotational semantics
</term>
. This
<term>
logical model
</term>
yields
#16952Our interpretation differs from that of Pereira and Shieber by using a logical model in place of adenotational semantics.
model,1-7-P86-1038,ak
denotational semantics
</term>
. This
<term>
logical model
</term>
yields a
<term>
calculus of equivalences
#16956Thislogical model yields a calculus of equivalences, which can be used to simplify formulas.
tech,5-7-P86-1038,ak
<term>
logical model
</term>
yields a
<term>
calculus of equivalences
</term>
, which can be used to simplify
<term>
#16960This logical model yields acalculus of equivalences, which can be used to simplify formulas.
tech,15-7-P86-1038,ak
</term>
, which can be used to simplify
<term>
formulas
</term>
.
<term>
Unification
</term>
is attractive
#16970This logical model yields a calculus of equivalences, which can be used to simplifyformulas.
tech,0-8-P86-1038,ak
to simplify
<term>
formulas
</term>
.
<term>
Unification
</term>
is attractive , because of its generality
#16972This logical model yields a calculus of equivalences, which can be used to simplify formulas.Unification is attractive, because of its generality, but it is often computationally inefficient.
model,1-9-P86-1038,ak
computationally inefficient . Our
<term>
model
</term>
allows a careful examination of the
#16989Ourmodel allows a careful examination of the computational complexity of unification.
other,8-9-P86-1038,ak
allows a careful examination of the
<term>
computational complexity
</term>
of
<term>
unification
</term>
. We have
#16996Our model allows a careful examination of thecomputational complexity of unification.
tech,11-9-P86-1038,ak
<term>
computational complexity
</term>
of
<term>
unification
</term>
. We have shown that the
<term>
consistency
#16999Our model allows a careful examination of the computational complexity ofunification.
other,5-10-P86-1038,ak
unification
</term>
. We have shown that the
<term>
consistency problem
</term>
for
<term>
formulas
</term>
with disjunctive
#17006We have shown that theconsistency problem for formulas with disjunctive values is NP-complete.
tech,8-10-P86-1038,ak
<term>
consistency problem
</term>
for
<term>
formulas
</term>
with disjunctive values is NP-complete
#17009We have shown that the consistency problem forformulas with disjunctive values is NP-complete.
other,4-11-P86-1038,ak
is NP-complete . To deal with this
<term>
complexity
</term>
, we describe how
<term>
disjunctive
#17020To deal with thiscomplexity, we describe how disjunctive values can be specified in a way which delays expansion to disjunctive normal form.
other,9-11-P86-1038,ak
complexity
</term>
, we describe how
<term>
disjunctive values
</term>
can be specified in a way which delays
#17025To deal with this complexity, we describe howdisjunctive values can be specified in a way which delays expansion to disjunctive normal form.
other,21-11-P86-1038,ak
in a way which delays expansion to
<term>
disjunctive normal form
</term>
. Currently several
<term>
grammatical
#17037To deal with this complexity, we describe how disjunctive values can be specified in a way which delays expansion todisjunctive normal form.