TreeView Knowledge Base Browser

appearance as argument number 1

(documentation EndNodeFn ChineseLanguage "这是一个 UnaryFunction，它把一个 GraphPath 和 GraphPath 末端的GraphNode。注：和 TerminalNodeFn不同 (把一个 GraphArc 和一个 GraphNode 联系)，EndNodeFn 是一个总体的函数 - 每个 GraphPath 都有它的末端。")	chinese_format.kif 2365-2367
(documentation EndNodeFn EnglishLanguage "A UnaryFunction that maps a GraphPath to the GraphNode that is the end of the GraphPath. Note that, unlike TerminalNodeFn (which relates a GraphArc to a GraphNode), EndNodeFn is a total function - every GraphPath has a end.")	Merge.kif 5924-5927
(domain EndNodeFn 1 GraphPath)	Merge.kif 5920-5920	domain EndNodeFn, 1 and GraphPath
(instance EndNodeFn TotalValuedRelation)	Merge.kif 5919-5919	instance EndNodeFn and TotalValuedRelation
(instance EndNodeFn UnaryFunction)	Merge.kif 5918-5918	instance EndNodeFn and UnaryFunction
(range EndNodeFn GraphNode)	Merge.kif 5921-5921	range EndNodeFn and GraphNode
(relatedInternalConcept EndNodeFn TerminalNodeFn)	Merge.kif 5922-5922	relatedInternalConcept EndNodeFn and TerminalNodeFn

appearance as argument number 2

(format ChineseLanguage EndNodeFn "%1 的末端")	chinese_format.kif 767-767
(format EnglishLanguage EndNodeFn "the end of %1")	english_format.kif 767-767
(termFormat ChineseLanguage EndNodeFn "结束节点")	domainEnglishFormat.kif 22036-22036
(termFormat ChineseLanguage EndNodeFn "节点末端")	chinese_format.kif 768-768
(termFormat ChineseTraditionalLanguage EndNodeFn "結束節點")	domainEnglishFormat.kif 22035-22035
(termFormat EnglishLanguage EndNodeFn "end node")	domainEnglishFormat.kif 22034-22034

antecedent

(=>
    (and
        (equal
            (BeginNodeFn ?GRAPH) ?NODE)
        (equal
            (EndNodeFn ?GRAPH) ?NODE))
    (instance ?GRAPH GraphCircuit))

Merge.kif 5732-5736

equal BeginNodeFn GraphPath and GraphNode equal EndNodeFn GraphPath and GraphNode
instance GraphPath and GraphCircuit

consequent

(=> (and (distanceOnPath ?DIST ?PATH) (pathInSystem ?PATH ?SYS) (routeStart ?START ?PATH) (routeEnd ?END ?PATH) (abstractCounterpart ?GRAPH ?SYS)) (exists (?S ?BN ?EN) (and (subGraph ?S ?GRAPH) (equal ?BN (BeginNodeFn ?GRAPH)) (equal ?EN (EndNodeFn ?GRAPH)) (abstractCounterpart ?BN ?START) (abstractCounterpart ?EN ?END))))	Transportation.kif 2806-2819	distanceOnPath ConstantQuantity and Transitway pathInSystem Transitway and TransitSystem routeStart Region and Transitway routeEnd Region and Transitway abstractCounterpart GraphPath and TransitSystem Graph GraphNode and GraphNode subGraph Graph and GraphPath equal GraphNode and BeginNodeFn GraphPath equal GraphNode and EndNodeFn GraphPath abstractCounterpart GraphNode and Region abstractCounterpart GraphNode and Region
(=> (and (instance ?GRAPH Graph) (instance ?NODE1 GraphNode) (instance ?NODE2 GraphNode) (graphPart ?NODE1 ?GRAPH) (graphPart ?NODE2 ?GRAPH) (not (equal ?NODE1 ?NODE2))) (exists (?ARC ?PATH) (or (links ?NODE1 ?NODE2 ?ARC) (and (subGraph ?PATH ?GRAPH) (instance ?PATH GraphPath) (or (and (equal (BeginNodeFn ?PATH) ?NODE1) (equal (EndNodeFn ?PATH) ?NODE2)) (and (equal (BeginNodeFn ?PATH) ?NODE2) (equal (EndNodeFn ?PATH) ?NODE1)))))))	Merge.kif 5597-5617	instance Graph and Graph instance GraphNode and GraphNode instance GraphNode and GraphNode graphPart GraphNode and Graph graphPart GraphNode and Graph equal GraphNode and GraphNode GraphArc GraphPath links GraphNode, GraphNode and GraphArc subGraph GraphPath and Graph instance GraphPath and GraphPath equal BeginNodeFn GraphPath and GraphNode equal EndNodeFn GraphPath and GraphNode equal BeginNodeFn GraphPath and GraphNode equal EndNodeFn GraphPath and GraphNode
(=> (instance ?GRAPH GraphCircuit) (exists (?NODE) (and (equal (BeginNodeFn ?GRAPH) ?NODE) (equal (EndNodeFn ?GRAPH) ?NODE))))	Merge.kif 5725-5730	instance GraphPath and GraphCircuit GraphNode equal BeginNodeFn GraphPath and GraphNode equal EndNodeFn GraphPath and GraphNode

Show simplified definition (without tree view)
Show simplified definition (with tree view)

KB Term:			Term intersection

English Word: