| other,2-8-T78-1031,bq | strengths of each . Applications of <term> | path-based inference rules | </term> to the representation of the <term> | #12187 Applications ofpath-based inference rules to the representation of the extensional equivalence of intensional concepts, and to the explication of inheritance in hierarchies are sketched. |
| other,15-5-T78-1031,bq | network </term> using a variant of a <term> | predicate calculus notation | </term> . <term> Path-based inference </term> | #12144 Node-based inference rules can be constructed in a semantic network using a variant of apredicate calculus notation. |
| other,8-5-T78-1031,bq | rules </term> can be constructed in a <term> | semantic network | </term> using a variant of a <term> predicate | #12137 Node-based inference rules can be constructed in asemantic network using a variant of a predicate calculus notation. |
| other,6-1-T78-1031,bq | performing <term> inference </term> in <term> | semantic networks | </term> are presented and compared . <term> | #12056 Two styles of performing inference insemantic networks are presented and compared. |
| other,4-4-T78-1031,bq | Node-based inference </term> allows a <term> | structure | </term> of <term> nodes </term> to be inferred | #12110 Node-based inference allows astructure of nodes to be inferred from the existence of an instance of a pattern of node structures. |
