| 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,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,7-4-P86-1038,bq | <term> graphs </term> are , in fact , <term> | transition graphs | </term> for a special type of <term> deterministic | #14706 These graphs are, in fact,transition graphs for a special type of deterministic finite automaton. |
| 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,8-1-P86-1038,bq | </term> use structures containing sets of <term> | features | </term> to describe <term> linguistic objects | #14631 Unification-based grammar formalisms use structures containing sets offeatures to describe linguistic objects. |
| 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,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. |
| 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. |
| other,9-3-P86-1038,bq | model </term> in which descriptions of <term> | feature structures | </term> can be regarded as <term> logical formulas | #14679 We have developed a model in which descriptions offeature structures can be regarded as logical formulas, and interpreted by sets of directed graphs which satisfy them. |
| 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. |
| tech,1-2-P86-1038,bq | linguistic objects </term> . Although <term> | computational algorithms for unification of feature structures | </term> have been worked out in experimental | #14638 Althoughcomputational algorithms for unification of feature structures have been worked out in experimental research, these algorithms become quite complicated, and a more precise description of feature structures is desirable. |
| 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. |
| tech,14-4-P86-1038,bq | graphs </term> for a special type of <term> | deterministic finite automaton | </term> . This <term> semantics </term> for <term> | #14713 These graphs are, in fact, transition graphs for a special type ofdeterministic finite automaton. |
| tech,17-2-P86-1038,bq | out in experimental research , these <term> | algorithms | </term> become quite complicated , and a | #14654 Although computational algorithms for unification of feature structures have been worked out in experimental research, thesealgorithms become quite complicated, and a more precise description of feature structures is desirable. |
| 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. |
