| 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 with disjunctive values is NP-complete. |
| other,11-1-P86-1038,bq | of <term> features </term> to describe <term> | linguistic objects | </term> . Although <term> computational algorithms | #14634 Unification-based grammar formalisms use structures containing sets of features to describe linguistic objects . |
| other,15-3-P86-1038,bq | structures </term> can be regarded as <term> | logical formulas | </term> , and interpreted by sets of <term> | #14685 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,18-6-P86-1038,bq | logical model </term> in place of a <term> | denotational semantics | </term> . This <term> logical model </term> | #14769 Our interpretation differs from that of Pereira and Shieber by using a logical model in place of a denotational semantics . |
