| other,1-7-P86-1038,bq | denotational semantics </term> . This <term> | logical model | </term> yields a calculus of <term> equivalences | #14773 Thislogical model yields a calculus of equivalences, which can be used to simplify formulas. |
| other,7-7-P86-1038,bq | logical model </term> yields a calculus of <term> | equivalences | </term> , which can be used to simplify <term> | #14779 This logical model yields a calculus ofequivalences, which can be used to simplify formulas. |
| other,15-7-P86-1038,bq | </term> , which can be used to simplify <term> | formulas | </term> . <term> Unification </term> is attractive | #14787 This logical model yields a calculus of equivalences, which can be used to simplifyformulas. |
| tech,0-8-P86-1038,bq | to simplify <term> formulas </term> . <term> | Unification | </term> is attractive , because of its generality | #14789 This 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. |
| other,1-9-P86-1038,bq | computationally inefficient . Our <term> | model | </term> allows a careful examination of the | #14806 Ourmodel allows a careful examination of the computational complexity of unification. |
| other,8-9-P86-1038,bq | allows a careful examination of the <term> | computational complexity | </term> of <term> unification </term> . We have | #14813 Our model allows a careful examination of thecomputational complexity of unification. |
| tech,11-9-P86-1038,bq | <term> computational complexity </term> of <term> | unification | </term> . We have shown that the <term> consistency | #14816 Our model allows a careful examination of the computational complexity ofunification. |
| other,5-10-P86-1038,bq | unification </term> . We have shown that the <term> | consistency problem | </term> for <term> formulas </term> with <term> | #14823 We have shown that theconsistency problem for formulas with disjunctive values is NP-complete. |
| other,8-10-P86-1038,bq | <term> consistency problem </term> for <term> | formulas | </term> with <term> disjunctive values </term> | #14826 We have shown that the consistency problem forformulas with disjunctive values is NP-complete. |
| other,10-10-P86-1038,bq | </term> for <term> formulas </term> with <term> | disjunctive values | </term> is <term> NP-complete </term> . To deal | #14828 We have shown that the consistency problem for formulas withdisjunctive values is NP-complete. |
| other,13-10-P86-1038,bq | with <term> disjunctive values </term> is <term> | NP-complete | </term> . To deal with this <term> complexity | #14831 We have shown that the consistency problem for formulas with disjunctive values isNP-complete. |
| other,4-11-P86-1038,bq | NP-complete </term> . To deal with this <term> | complexity | </term> , we describe how <term> disjunctive | #14837 To 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,bq | complexity </term> , we describe how <term> | disjunctive | </term> values can be specified in a way | #14842 To deal with this complexity, we describe howdisjunctive values can be specified in a way which delays expansion to disjunctive normal form. |
| tech,19-11-P86-1038,bq | be specified in a way which delays <term> | expansion | </term> to <term> disjunctive normal form </term> | #14852 To deal with this complexity, we describe how disjunctive values can be specified in a way which delaysexpansion to disjunctive normal form. |
| other,21-11-P86-1038,bq | which delays <term> expansion </term> to <term> | disjunctive normal form | </term> . This paper describes a domain independent | #14854 To deal with this complexity, we describe how disjunctive values can be specified in a way which delays expansion todisjunctive normal form. |
