Browsing Interface
: Welcome guest :
log in
[
Home
| 
Graph
|  ]
KB:
SUMO
Language:
ChineseLanguage
ChinesePinyinWriting
ChineseSimplifiedWriting
ChineseTraditionalLanguage
EnglishLanguage
FrenchLanguage
GermanLanguage
HerbaceousPlant
Hindi
ItalianLanguage
JapaneseLanguage
PortugueseLanguage
SpanishLanguage
SwedishLanguage
WoodyPlant
cb
cz
de
hi
ro
sv
tg
Formal Language:
OWL
SUO-KIF
TPTP
traditionalLogic
KB Term:
Term intersection
English Word:
Any
Noun
Verb
Adjective
Adverb
MaximalWeightedPathFn
Sigma KEE - MaximalWeightedPathFn
MaximalWeightedPathFn
appearance as argument number 1
(
documentation
MaximalWeightedPathFn
ChineseLanguage
"这是一个
BinaryFunction
,它以两个
GraphNode
之间弧衡量总和的最大值,把两个
GraphNode
分配到
GraphPath
上。")
chinese_format.kif 2374-2375
(
documentation
MaximalWeightedPathFn
EnglishLanguage
"This
BinaryFunction
assigns two
GraphNode
s to the
GraphPath
with the largest sum of weighted arcs between the two
GraphNode
s.")
Merge.kif 6036-6038
(
documentation
MaximalWeightedPathFn
JapaneseLanguage
"この
BinaryFunction
は、2つの
GraphNode
s 間の加重円弧の最大合計を持つ2つの
GraphNode
を
GraphPath
に割り当てる。")
japanese_format.kif 1051-1052
(
domain
MaximalWeightedPathFn
1
GraphNode
)
Merge.kif 6032-6032
O argumento numero 1 de
MaximalWeightedPathFn
e' uma
instancia
de
No' do Grafo
(
domain
MaximalWeightedPathFn
2
GraphNode
)
Merge.kif 6033-6033
O argumento numero 2 de
MaximalWeightedPathFn
e' uma
instancia
de
No' do Grafo
(
instance
MaximalWeightedPathFn
BinaryFunction
)
Merge.kif 6030-6030
MaximalWeightedPathFn
e' uma
instancia
de
Funcao Binaria
(
instance
MaximalWeightedPathFn
TotalValuedRelation
)
Merge.kif 6031-6031
MaximalWeightedPathFn
e' uma
instancia
de
Relacao Total
(
range
MaximalWeightedPathFn
GraphPath
)
Merge.kif 6034-6034
O
contra
-dominio de
MaximalWeightedPathFn
e' uma instancia de
Caminho do Grafo
appearance as argument number 2
(
format
ChineseLanguage
MaximalWeightedPathFn
"%1 和 %2 间的最高成本路径")
chinese_format.kif 773-773
(
format
EnglishLanguage
MaximalWeightedPathFn
"the
hi
ghest cost
path
between %1 and %2")
english_format.kif 773-773
(
format
FrenchLanguage
MaximalWeightedPathFn
"le plus grand chemin entre %1 et %2")
french_format.kif 466-466
(
format
ItalianLanguage
MaximalWeightedPathFn
"il il cammino col costo maggiore tra %1 e %2")
relations-it.txt 176-176
(
format
JapaneseLanguage
MaximalWeightedPathFn
"%1 と %2 間の
hi
ghest cost
path
")
japanese_format.kif 2170-2170
(
format
PortugueseLanguage
MaximalWeightedPathFn
"o maior caminho entre %1 e %2")
portuguese_format.kif 418-418
(
format
de
MaximalWeightedPathFn
"der Pfad der hoechsten Kosten zwischen %1 und %2")
relations-de.txt 1000-1000
(
format
hi
MaximalWeightedPathFn
"%1 aura %2 ke biicha men uchchatama patha")
relations-hindi.txt 214-214
(
format
ro
MaximalWeightedPathFn
"
path
%t{drumul} de cost%t{cost}
hi
ghest%t{maxim} între %1 ºi %2")
relations-ro.kif 488-488
(
format
sv
MaximalWeightedPathFn
"den mest kostsamma vägen mellan %1 och %2")
relations-sv.txt 535-535
(
format
tg
MaximalWeightedPathFn
"ang sakdal mahal ng landas sagitna %1 at %2")
relations-tg.txt 349-349
(
termFormat
ChineseLanguage
MaximalWeightedPathFn
"最大加权路径")
domainEnglishFormat.kif 36593-36593
(
termFormat
ChineseLanguage
MaximalWeightedPathFn
"最高加权路径函数")
chinese_format.kif 774-774
(
termFormat
ChineseTraditionalLanguage
MaximalWeightedPathFn
"最大加權路徑")
domainEnglishFormat.kif 36592-36592
(
termFormat
EnglishLanguage
MaximalWeightedPathFn
"maximal weighted path")
domainEnglishFormat.kif 36591-36591
antecedent
(=>
(
and
(
equal
(
MaximalWeightedPathFn
?NODE1 ?NODE2) ?PATH)
(
equal
(
PathWeightFn
?PATH) ?NUMBER1)
(
instance
?PATH2
(
GraphPathFn
?NODE1 ?NODE2))
(
equal
(
PathWeightFn
?PATH2) ?NUMBER2))
(
lessThanOrEqualTo
?NUMBER2 ?NUMBER1))
Merge.kif 6044-6050
O maior
caminho
entre
No' do Grafo
e
No' do Grafo
e'
igual
a
Caminho do Grafo
o
valor
de
Caminho do Grafo
e'
igual
a
Numero Real
Caminho do Grafo
2 e' uma
instancia
de o
conjunto
de caminhos entre
No' do Grafo
e
No' do Grafo
o
valor
de
Caminho do Grafo
2 e'
igual
a
Numero Real
Numero Real
e'
menor
ou igual a
Numero Real
(=>
(
equal
(
MaximalWeightedPathFn
?NODE1 ?NODE2) ?PATH)
(
instance
?PATH
(
GraphPathFn
?NODE1 ?NODE2)))
Merge.kif 6040-6042
O maior
caminho
entre
No' do Grafo
e
No' do Grafo
e'
igual
a
Caminho do Grafo
Caminho do Grafo
e' uma
instancia
de o
conjunto
de caminhos entre
No' do Grafo
e
No' do Grafo
Show simplified definition (without tree view)
Show simplified definition (with tree view)
Show without tree
Sigma web home
Suggested Upper Merged Ontology (SUMO) web home
Sigma version 3.0 is
open source software
produced by
Articulate Software
and its partners