| other,9-3-P86-1038,ak | model </term> in which descriptions of <term> | feature structures | </term> can be regarded as <term> logical formulas | #16862 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,ak | to simplify <term> formulas </term> . <term> | Unification | </term> is attractive , because of its generality | #16972 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,ak | linguistic objects </term> . Although <term> | computational algorithms | </term> for <term> unification of feature structures | #16821 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,1-4-P86-1038,ak | graphs </term> which satisfy them . These <term> | graphs | </term> are , in fact , <term> transition graphs | #16883 Thesegraphs are, in fact, transition graphs for a special type of deterministic finite automaton. | |
| tech,11-9-P86-1038,ak | <term> computational complexity </term> of <term> | unification | </term> . We have shown that the <term> consistency | #16999 Our model allows a careful examination of the computational complexity ofunification. | |
| tech,14-4-P86-1038,ak | graphs </term> for a special type of <term> | deterministic finite automaton | </term> . This <term> semantics </term> for <term> | #16896 These graphs are, in fact, transition graphs for a special type ofdeterministic finite automaton. | |
| tech,15-3-P86-1038,ak | structures </term> can be regarded as <term> | logical formulas | </term> , and interpreted by sets of <term> | #16868 We have developed a model in which descriptions of feature structures can be regarded aslogical formulas, and interpreted by sets of directed graphs which satisfy them. | |
| tech,15-7-P86-1038,ak | </term> , which can be used to simplify <term> | formulas | </term> . <term> Unification </term> is attractive | #16970 This logical model yields a calculus of equivalences, which can be used to simplifyformulas. | |
| tech,17-2-P86-1038,ak | out in experimental research , these <term> | algorithms | </term> become quite complicated , and a | #16837 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,23-3-P86-1038,ak | </term> , and interpreted by sets of <term> | directed graphs | </term> which satisfy them . These <term> graphs | #16876 We have developed a model in which descriptions of feature structures can be regarded as logical formulas, and interpreted by sets ofdirected graphs which satisfy them. | |
| tech,4-2-P86-1038,ak | computational algorithms </term> for <term> | unification of feature structures | </term> have been worked out in experimental | #16824 Although computational algorithms forunification 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,5-7-P86-1038,ak | <term> logical model </term> yields a <term> | calculus of equivalences | </term> , which can be used to simplify <term> | #16960 This logical model yields acalculus of equivalences, which can be used to simplify formulas. | |
| tech,7-4-P86-1038,ak | <term> graphs </term> are , in fact , <term> | transition graphs | </term> for a special type of <term> deterministic | #16889 These graphs are, in fact,transition graphs for a special type of deterministic finite automaton. | |
| tech,8-10-P86-1038,ak | <term> consistency problem </term> for <term> | formulas | </term> with disjunctive values is NP-complete | #17009 We have shown that the consistency problem forformulas with disjunctive values is NP-complete. |
