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

Formal Language: 



KB Term:  Term intersection
English Word: 

Sigma KEE - GraphPathFn
GraphPathFn

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


s__documentation(s__GraphPathFn__m,s__ChineseLanguage,'"这是一个 BinaryFunction,它把两个GraphNode 联系到这两个节点之间的 GraphPath Class。注:这两个 GraphNode 必须属于同一个 Graph。"')

chinese_format.kif 2376-2377
s__documentation(s__GraphPathFn__m,s__EnglishLanguage,'"A BinaryFunction that maps two GraphNodes to the Class of GraphPaths between those two nodes. Note that the two GraphNodes must belong to the same Graph."')

Merge.kif 5709-5711
s__domain(s__GraphPathFn__m,n__1,s__GraphNode)

Merge.kif 5705-5705 The number 1 argument of graph path is an instance of graph node
s__domain(s__GraphPathFn__m,n__2,s__GraphNode)

Merge.kif 5706-5706 The number 2 argument of graph path is an instance of graph node
s__instance(s__GraphPathFn__m,s__BinaryFunction)

s__instance(s__BinaryFunction,s__SetOrClass)

Merge.kif 5703-5703 Graph path is an instance of binary function
s__instance(s__GraphPathFn__m,s__TotalValuedRelation)

s__instance(s__TotalValuedRelation,s__SetOrClass)

Merge.kif 5704-5704 Graph path is an instance of total valued relation
s__rangeSubclass(s__GraphPathFn__m,s__GraphPath)

Merge.kif 5707-5707 The values returned by graph path are subclasses of graph path

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


s__format(s__ChineseLanguage,s__GraphPathFn__m,'"%1 和 %2 的路径集 Set"')

chinese_format.kif 775-775
s__format(s__EnglishLanguage,s__GraphPathFn__m,'"the set of paths between %1 and %2"')

english_format.kif 778-778
s__termFormat(s__ChineseLanguage,s__GraphPathFn__m,'"图形路径"')

domainEnglishFormat.kif 26389-26389
s__termFormat(s__ChineseLanguage,s__GraphPathFn__m,'"图路函数"')

chinese_format.kif 776-776
s__termFormat(s__ChineseTraditionalLanguage,s__GraphPathFn__m,'"圖形路徑"')

domainEnglishFormat.kif 26388-26388
s__termFormat(s__EnglishLanguage,s__GraphPathFn__m,'"graph path"')

domainEnglishFormat.kif 26387-26387

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


( ! [V__NODE2,V__NODE1,V__NUMBER1,V__NUMBER2,V__PATH] :
   ((s__instance(V__NODE2,s__GraphNode) &
       s__instance(V__NODE1,s__GraphNode) &
       s__instance(V__NUMBER1,s__Quantity) &
       s__instance(V__NUMBER2,s__Quantity) &
       s__instance(V__PATH,s__GraphPath))
     =>
     ((s__MaximalWeightedPathFn(V__NODE1,V__NODE2)
       = V__PATH)
     &
     (s__PathWeightFn(V__PATH)
     = V__NUMBER1))
=>
( ! [V__PATH2] :
   (s__instance(V__PATH2,s__GraphPath) =>
     (s__instance(V__PATH2,s__GraphPathFn(V__NODE1,V__NODE2))
   &
   (s__PathWeightFn(V__PATH2)
   = V__NUMBER2))
=>
s__lessThanOrEqualTo(V__NUMBER2,V__NUMBER1)))
)
)

Merge.kif 5692-5701
( ! [V__NODE2,V__NODE1,V__NUMBER1,V__NUMBER2,V__PATH] :
   ((s__instance(V__NODE2,s__GraphNode) &
       s__instance(V__NODE1,s__GraphNode) &
       s__instance(V__NUMBER1,s__Quantity) &
       s__instance(V__NUMBER2,s__Quantity) &
       s__instance(V__PATH,s__GraphPath))
     =>
     ((s__MinimalWeightedPathFn(V__NODE1,V__NODE2)
       = V__PATH)
     &
     (s__PathWeightFn(V__PATH)
     = V__NUMBER1))
=>
( ! [V__PATH2] :
   (s__instance(V__PATH2,s__GraphPath) =>
     (s__instance(V__PATH2,s__GraphPathFn(V__NODE1,V__NODE2))
   &
   (s__PathWeightFn(V__PATH2)
   = V__NUMBER2))
=>
s__greaterThanOrEqualTo(V__NUMBER2,V__NUMBER1)))
)
)

Merge.kif 5667-5676
( ! [V__NODE2,V__NODE1,V__PATH,V__GRAPH] :
   ((s__instance(V__NODE2,s__GraphNode) &
       s__instance(V__NODE1,s__GraphNode) &
       s__instance(V__PATH,s__GraphElement) &
       s__instance(V__GRAPH,s__Graph))
     =>
     (s__graphPart(V__PATH,V__GRAPH)
     &
     ~(s__instance(V__GRAPH,s__DirectedGraph)))
   =>
   (s__instance(V__PATH,s__GraphPathFn(V__NODE1,V__NODE2))
=>
s__instance(V__PATH,s__GraphPathFn(V__NODE2,V__NODE1)))
&
(s__instance(V__PATH,s__GraphPathFn(V__NODE2,V__NODE1))
=>
s__instance(V__PATH,s__GraphPathFn(V__NODE1,V__NODE2)))
)
)

Merge.kif 5713-5719
( ! [V__NODE2,V__NODE1,V__PATH] :
   ((s__instance(V__NODE2,s__GraphNode) &
       s__instance(V__NODE1,s__GraphNode) &
       s__instance(V__PATH,s__GraphPath))
     =>
     (s__MaximalWeightedPathFn(V__NODE1,V__NODE2)
     = V__PATH)
   =>
   s__instance(V__PATH,s__GraphPathFn(V__NODE1,V__NODE2))
)
)

Merge.kif 5688-5690
( ! [V__NODE2,V__NODE1,V__PATH] :
   ((s__instance(V__NODE2,s__GraphNode) &
       s__instance(V__NODE1,s__GraphNode) &
       s__instance(V__PATH,s__GraphPath))
     =>
     (s__MinimalWeightedPathFn(V__NODE1,V__NODE2)
     = V__PATH)
   =>
   s__instance(V__PATH,s__GraphPathFn(V__NODE1,V__NODE2))
)
)

Merge.kif 5663-5665


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