| model,4-3-P86-1038,bq | is desirable . We have developed a <term> | model | </term> in which descriptions of <term> feature | #14674 We have developed a model in which descriptions of feature structures can be regarded as logical formulas, and interpreted by sets of directed graphs which satisfy them. |
| other,1-9-P86-1038,bq | computationally inefficient . Our <term> | model | </term> allows a careful examination of | #14806 Our model allows a careful examination of the computational complexity of unification. |
| 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 this complexity , we describe how disjunctive values can be specified in a way which delays expansion to disjunctive normal form. |
| tech,11-9-P86-1038,bq | 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 of unification . |
| 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 delays expansion to disjunctive normal form. |
