| model,0-5-T78-1031,ak | </term> of <term> node structures </term> . <term> | Node-based inference rules | </term> can be constructed in a <term> semantic | #13066 Node-based inference allows a structure of nodes to be inferred from the existence of an instance of a pattern of node structures. Node-based inference rules can be constructed in a semantic network using a variant of a predicate calculus notation. | |
| model,2-8-T78-1031,ak | strengths of each . Applications of <term> | path-based inference rules | </term> to the representation of the <term> | #13124 Applications of path-based inference rules to the representation of the extensional equivalence of intensional concepts, and to the explication of inheritance in hierarchies are sketched. | |
| model,0-3-T78-1031,ak | between the same two <term> nodes </term> . <term> | Path-based inference rules | </term> may be written using a <term> binary | #13030 Path-based inference allows an arc or a path of arcs between two given nodes to be inferred from the existence of another specified path between the same two nodes. Path-based inference rules may be written using a binary relational calculus notation. |
