Browsing Interface : Welcome guest : log in
|
Browsing Interface : Welcome guest : log in |
[
Home |
Graph |
LogLearn |
Editor |
]
KB:
Language:
Formal Language:
|
| TerminalNodeFn |
| appearance as argument number 1 |
|
| (instance TerminalNodeFn UnaryFunction) | Merge.kif 6049-6049 | Terminal node is an instance of unary function |
| (instance TerminalNodeFn PartialValuedRelation) | Merge.kif 6050-6050 | Terminal node is an instance of partial valued relation |
| (domain TerminalNodeFn 1 GraphArc) | Merge.kif 6051-6051 | The number 1 argument of terminal node is an instance of graph arc |
| (range TerminalNodeFn GraphNode) | Merge.kif 6052-6052 | The range of terminal node is an instance of graph node |
| (documentation TerminalNodeFn EnglishLanguage "A UnaryFunction that maps a GraphArc to the terminal node of the GraphArc. Note that this is a partial function. In particular, the function is undefined for GraphArcs that are not part of a DirectedGraph.") | Merge.kif 6054-6057 | The range of terminal node is an instance of graph node |
| appearance as argument number 2 |
|
|
| (relatedInternalConcept EndNodeFn TerminalNodeFn) | Merge.kif 6074-6074 | End node is internally related to terminal node |
| (termFormat EnglishLanguage TerminalNodeFn "terminal node") | domainEnglishFormat.kif 57551-57551 | End node is internally related to terminal node |
| (termFormat ChineseTraditionalLanguage TerminalNodeFn "終端節點") | domainEnglishFormat.kif 57552-57552 | End node is internally related to terminal node |
| (termFormat ChineseLanguage TerminalNodeFn "终端节点") | domainEnglishFormat.kif 57553-57553 | End node is internally related to terminal node |
| (format EnglishLanguage TerminalNodeFn "the terminal node of %1") | english_format.kif 763-763 | End node is internally related to terminal node |
| antecedent |
|
|
| (=> (and (instance ?GRAPH GraphPath) (instance ?ARC GraphArc) (graphPart ?ARC ?GRAPH) (equal (TerminalNodeFn ?ARC) ?NODE)) (not (exists (?OTHER) (and (equal (TerminalNodeFn ?OTHER) ?NODE) (not (equal ?OTHER ?ARC)))))) |
Merge.kif 5859-5870 | If X is an instance of graph path, Y is an instance of graph arc, Y is a part of X, and equal the terminal node of Y and Z, then there doesn't exist W such that equal the terminal node of W, Z, equal W, and Y |
| (=> (and (equal (InitialNodeFn ?ARC) ?NODE) (equal (TerminalNodeFn ?ARC) ?NODE)) (instance ?ARC GraphLoop)) |
Merge.kif 5986-5990 | If equal the starting node of X and Y and equal the terminal node of X and Y, then X is an instance of graph loop |
| consequent |
|
|
| (=> (and (instance ?GRAPH DirectedGraph) (instance ?ARC GraphArc) (graphPart ?ARC ?GRAPH)) (exists (?NODE1 ?NODE2) (and (equal (InitialNodeFn ?ARC) ?NODE1) (equal (TerminalNodeFn ?ARC) ?NODE2)))) |
Merge.kif 5795-5803 | If X is an instance of directed graph, Y is an instance of graph arc, and Y is a part of X, then there exist Z, W such that equal the starting node of Y, Z, equal the terminal node of Y, and W |
| (=> (instance ?GRAPH Tree) (not (exists (?ARC1 ?ARC2 ?NODE) (and (graphPart ?ARC1 ?GRAPH) (graphPart ?ARC2 ?GRAPH) (graphPart ?NODE ?GRAPH) (equal (TerminalNodeFn ?ARC1) ?NODE) (equal (TerminalNodeFn ?ARC2) ?NODE) (not (equal ?ARC1 ?ARC2)))))) |
Merge.kif 5826-5836 | If X is an instance of tree, then All of the following hold: (1) there don't exist Y, Z (2) W such that Y is a part of X (3) Z is a part of X (4) W is a part of X (5) equal the terminal node of Y (6) W (7) equal the terminal node of Z (8) W (9) equal Y (10) Z |
| (=> (and (instance ?GRAPH GraphPath) (instance ?ARC GraphArc) (graphPart ?ARC ?GRAPH) (equal (TerminalNodeFn ?ARC) ?NODE)) (not (exists (?OTHER) (and (equal (TerminalNodeFn ?OTHER) ?NODE) (not (equal ?OTHER ?ARC)))))) |
Merge.kif 5859-5870 | If X is an instance of graph path, Y is an instance of graph arc, Y is a part of X, and equal the terminal node of Y and Z, then there doesn't exist W such that equal the terminal node of W, Z, equal W, and Y |
|