Browsing Interface : Welcome guest : log in
Home |  Graph |  ]  KB:  Language:   

Formal Language: 



KB Term:  Term intersection
English Word: 

Sigma KEE - EndNodeFn
EndNodeFn

appearance as argument number 1
-------------------------


s__documentation(s__EndNodeFn__m,s__ChineseLanguage,'"这是一个 UnaryFunction,它把一个 GraphPathGraphPath 末端的GraphNode。注:和 TerminalNodeFn不同 (把一个 GraphArc 和一个 GraphNode 联系),EndNodeFn 是一个总体的函数 - 每个 GraphPath 都有它的末端。"')

chinese_format.kif 2365-2367
s__documentation(s__EndNodeFn__m,s__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 5602-5605
s__domain(s__EndNodeFn__m,n__1,s__GraphPath)

Merge.kif 5598-5598 The number 1 argument of end node is an instance of graph path
s__instance(s__TotalValuedRelation,s__SetOrClass)

s__instance(s__EndNodeFn__m,s__TotalValuedRelation)

Merge.kif 5597-5597 End node is an instance of total valued relation
s__instance(s__UnaryFunction,s__SetOrClass)

s__instance(s__EndNodeFn__m,s__UnaryFunction)

Merge.kif 5596-5596 End node is an instance of unary function
s__range(s__EndNodeFn__m,s__GraphNode)

Merge.kif 5599-5599 The range of end node is an instance of graph node
s__relatedInternalConcept(s__EndNodeFn__m,s__TerminalNodeFn__m)

Merge.kif 5600-5600 End node is internally related to terminal node

appearance as argument number 2
-------------------------


s__format(s__ChineseLanguage,s__EndNodeFn__m,'"%1 的末端"')

chinese_format.kif 767-767
s__format(s__EnglishLanguage,s__EndNodeFn__m,'"the end of %1"')

english_format.kif 770-770
s__termFormat(s__ChineseLanguage,s__EndNodeFn__m,'"结束节点"')

domainEnglishFormat.kif 21973-21973
s__termFormat(s__ChineseLanguage,s__EndNodeFn__m,'"节点末端"')

chinese_format.kif 768-768
s__termFormat(s__ChineseTraditionalLanguage,s__EndNodeFn__m,'"結束節點"')

domainEnglishFormat.kif 21972-21972
s__termFormat(s__EnglishLanguage,s__EndNodeFn__m,'"end node"')

domainEnglishFormat.kif 21971-21971

consequent
-------------------------


( ! [V__GRAPH] :
   ((s__instance(V__GRAPH,s__GraphCircuit) =>
       ( ? [V__NODE] :
         ((s__instance(V__NODE,s__GraphNode) &
             ((s__BeginNodeFn(V__GRAPH)
               = V__NODE)
             &
             (s__EndNodeFn(V__GRAPH)
             = V__NODE))))))
&
(( ? [V__NODE] :
     ((s__instance(V__NODE,s__GraphNode) &
         ((s__BeginNodeFn(V__GRAPH)
           = V__NODE)
         &
         (s__EndNodeFn(V__GRAPH)
         = V__NODE)))))
=>
s__instance(V__GRAPH,s__GraphCircuit))
)
)

Merge.kif 5429-5434 A graph path is an instance of graph circuit if and only if there exists a graph node such that the beginning of the graph path is equal to the graph node and the end of the graph path is equal to the graph node
( ! [V__END,V__DIST,V__SYS,V__PATH,V__START,V__GRAPH] :
   ((s__instance(V__END,s__Region) &
       s__instance(V__DIST,s__ConstantQuantity) &
       s__instance(V__SYS,s__TransitSystem) &
       s__instance(V__PATH,s__Transitway) &
       s__instance(V__PATH,s__TransitSystem) &
       s__instance(V__START,s__Region) &
       s__instance(V__GRAPH,s__GraphPath))
     =>
     (s__distanceOnPath(V__DIST,V__PATH)
     &
     s__pathInSystem(V__PATH,V__SYS)
   &
   s__routeStart(V__START,V__PATH)
&
s__routeEnd(V__END,V__PATH)
&
s__abstractCounterpart(V__GRAPH,V__SYS))
=>
( ? [V__S, V__BN, V__EN] :
((s__instance(V__S,s__Graph) &
s__instance(V__BN,s__GraphNode) &
s__instance(V__EN,s__GraphNode) &
(s__subGraph(V__S,V__GRAPH)
&
(V__BN = s__BeginNodeFn(V__GRAPH))
&
(V__EN = s__EndNodeFn(V__GRAPH))
&
s__abstractCounterpart(V__BN,V__START)
&
s__abstractCounterpart(V__EN,V__END)))))
)
)

Transportation.kif 2784-2797
( ! [V__NODE2,V__NODE1,V__GRAPH] :
   ((s__instance(V__GRAPH,s__Graph) &
       s__instance(V__NODE1,s__GraphNode) &
       s__instance(V__NODE2,s__GraphNode) &
       s__graphPart(V__NODE1,V__GRAPH)
     &
     s__graphPart(V__NODE2,V__GRAPH)
   &
   ~((V__NODE1 = V__NODE2)))
=>
( ? [V__ARC, V__PATH] :
   ((s__instance(V__ARC,s__GraphArc) &
       (s__links(V__NODE1,V__NODE2,V__ARC)
       |
       (s__subGraph(V__PATH,V__GRAPH)
       &
       s__instance(V__PATH,s__GraphPath) &
       (((s__BeginNodeFn(V__PATH)
           = V__NODE1)
         &
         (s__EndNodeFn(V__PATH)
         = V__NODE2))
     |
     ((s__BeginNodeFn(V__PATH)
       = V__NODE2)
     &
     (s__EndNodeFn(V__PATH)
     = V__NODE1))))))))
)
)

Merge.kif 5303-5323


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



Sigma web home      Suggested Upper Merged Ontology (SUMO) web home
Sigma version 2.99c (>= 2017/11/20) is open source software produced by Articulate Software and its partners