tech,0-2-T78-1031,bq |
</term>
are presented and compared .
<term>
|
Path-based inference
|
</term>
allows an
<term>
arc
</term>
or a
<term>
|
#12063
Two styles of performing inference in semantic networks are presented and compared. 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. |
tech,0-4-T78-1031,bq |
relational calculus notation
</term>
.
<term>
|
Node-based inference
|
</term>
allows a
<term>
structure
</term>
of
|
#12106
Path-based inference rules may be written using a binary relational calculus notation. Node-based inference allows a structure of nodes to be inferred from the existence of an instance of a pattern of node structures. |
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 a semantic network using a variant of a predicate calculus notation. |
tech,0-6-T78-1031,bq |
predicate calculus notation
</term>
.
<term>
|
Path-based inference
|
</term>
is more efficient , while
<term>
node-based
|
#12148
Node-based inference rules can be constructed in a semantic network using a variant of a predicate calculus notation. Path-based inference is more efficient, while node-based inference is more general. |
tech,7-6-T78-1031,bq |
inference
</term>
is more efficient , while
<term>
|
node-based inference
|
</term>
is more general . A method is described
|
#12155
Path-based inference is more efficient, while node-based inference is more general. |