Concordance

tech,8-3-T78-1031,ak

other,23-8-T78-1031,ak

other,21-8-T78-1031,ak

other,20-4-T78-1031,ak

tech,7-6-T78-1031,ak

other,13-2-T78-1031,ak

other,6-4-T78-1031,ak

other,7-2-T78-1031,ak

tech,0-6-T78-1031,ak

model,2-8-T78-1031,ak

other,4-2-T78-1031,ak	Path-based inference </term> allows an <term>	arc	</term> or a <term> path of arcs </term> between	#13004 Path-based inference allows anarc 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,8-3-T78-1031,ak	rules </term> may be written using a <term>	binary relational calculus notation	</term> . <term> Node-based inference </term>	#13038 Path-based inference rules may be written using abinary relational calculus notation.
other,10-8-T78-1031,ak	</term> to the representation of the <term>	extensional equivalence	</term> of <term> intensional concepts </term>	#13132 Applications of path-based inference rules to the representation of theextensional equivalence of intensional concepts, and to the explication of inheritance in hierarchies are sketched.
other,23-8-T78-1031,ak	explication of <term> inheritance </term> in <term>	hierarchies	</term> are sketched . In order to meet the	#13145 Applications of path-based inference rules to the representation of the extensional equivalence of intensional concepts, and to the explication of inheritance inhierarchies are sketched.
tech,4-1-T78-1031,ak	triggered . Two styles of performing <term>	inference	</term> in <term> semantic networks </term> are	#12991 Two styles of performinginference in semantic networks are presented and compared.
other,21-8-T78-1031,ak	</term> , and to the explication of <term>	inheritance	</term> in <term> hierarchies </term> are sketched	#13143 Applications of path-based inference rules to the representation of the extensional equivalence of intensional concepts, and to the explication ofinheritance in hierarchies are sketched.
other,13-8-T78-1031,ak	<term> extensional equivalence </term> of <term>	intensional concepts	</term> , and to the explication of <term>	#13135 Applications of path-based inference rules to the representation of the extensional equivalence ofintensional concepts, and to the explication of inheritance in hierarchies are sketched.
other,20-4-T78-1031,ak	instance of a <term> pattern </term> of <term>	node structures	</term> . <term> Node-based inference rules	#13063 Node-based inference allows a structure of nodes to be inferred from the existence of an instance of a pattern ofnode structures.
tech,0-4-T78-1031,ak	relational calculus notation </term> . <term>	Node-based inference	</term> allows a structure of <term> nodes </term>	#13043 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.
tech,7-6-T78-1031,ak	inference </term> is more efficient , while <term>	node-based inference	</term> is more general . A method is described	#13092 Path-based inference is more efficient, whilenode-based inference is more general.
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.
other,13-2-T78-1031,ak	path of arcs </term> between two given <term>	nodes	</term> to be inferred from the existence	#13013 Path-based inference allows an arc or a path of arcs between two givennodes to be inferred from the existence of another specified path between the same two nodes.
other,28-2-T78-1031,ak	<term> path </term> between the same two <term>	nodes	</term> . <term> Path-based inference rules	#13028 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 twonodes.
other,6-4-T78-1031,ak	inference </term> allows a structure of <term>	nodes	</term> to be inferred from the existence	#13049 Node-based inference allows a structure ofnodes to be inferred from the existence of an instance of a pattern of node structures.
other,23-2-T78-1031,ak	the existence of another specified <term>	path	</term> between the same two <term> nodes </term>	#13023 Path-based inference allows an arc or a path of arcs between two given nodes to be inferred from the existence of another specifiedpath between the same two nodes.
other,7-2-T78-1031,ak	</term> allows an <term> arc </term> or a <term>	path of arcs	</term> between two given <term> nodes </term>	#13007 Path-based inference allows an arc or apath of arcs between two given nodes to be inferred from the existence of another specified path between the same two nodes.
tech,0-2-T78-1031,ak	</term> are presented and compared . <term>	Path-based inference	</term> allows an <term> arc </term> or a <term>	#13000 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-6-T78-1031,ak	predicate calculus notation </term> . <term>	Path-based inference	</term> is more efficient , while <term> node-based	#13085 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.
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.
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 ofpath-based inference rules to the representation of the extensional equivalence of intensional concepts, and to the explication of inheritance in hierarchies are sketched.


	in Help