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

Formal Language: 



KB Term:  Term intersection
English Word: 

Sigma KEE - MinimalWeightedPathFn
MinimalWeightedPathFn

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


s__documentation(s__MinimalWeightedPathFn__m,s__ChineseLanguage,'"这是一个 BinaryFunction，它以两个 GraphNode 之间弧衡量总和的最小值，把两个 GraphNode 分配到 GraphPath 上。"')

 chinese_format.kif 2372-2373
s__documentation(s__MinimalWeightedPathFn__m,s__EnglishLanguage,'"This BinaryFunction assigns two GraphNodes to the GraphPath with the smallest sum of weighted arcs between the two GraphNodes."')

 Merge.kif 5659-5661
s__domain(s__MinimalWeightedPathFn__m,n__1,s__GraphNode)

 Merge.kif 5655-5655 The number 1 argument of minimal weighted path is an instance of graph node
s__domain(s__MinimalWeightedPathFn__m,n__2,s__GraphNode)

 Merge.kif 5656-5656 The number 2 argument of minimal weighted path is an instance of graph node
s__instance(s__BinaryFunction,s__SetOrClass)

s__instance(s__MinimalWeightedPathFn__m,s__BinaryFunction)

 Merge.kif 5653-5653 Minimal weighted path is an instance of binary function
s__instance(s__MinimalWeightedPathFn__m,s__TotalValuedRelation)

s__instance(s__TotalValuedRelation,s__SetOrClass)

 Merge.kif 5654-5654 Minimal weighted path is an instance of total valued relation
s__range(s__MinimalWeightedPathFn__m,s__GraphPath)

 Merge.kif 5657-5657 The range of minimal weighted path is an instance of graph path

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


s__format(s__ChineseLanguage,s__MinimalWeightedPathFn__m,'"%1 和 %2 间的最低成本路径"')

 chinese_format.kif 771-771
s__format(s__EnglishLanguage,s__MinimalWeightedPathFn__m,'"the lowest cost path between %1 and %2"')

 english_format.kif 774-774
s__termFormat(s__ChineseLanguage,s__MinimalWeightedPathFn__m,'"最低加权路径函数"')

 chinese_format.kif 772-772
s__termFormat(s__ChineseLanguage,s__MinimalWeightedPathFn__m,'"最小加权路径"')

 domainEnglishFormat.kif 37771-37771
s__termFormat(s__ChineseTraditionalLanguage,s__MinimalWeightedPathFn__m,'"最小加權路徑"')

 domainEnglishFormat.kif 37770-37770
s__termFormat(s__EnglishLanguage,s__MinimalWeightedPathFn__m,'"minimal weighted path"')

 domainEnglishFormat.kif 37769-37769

antecedent
-------------------------


( ! [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] :
   ((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