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
GraphPathFn
Sigma KEE - GraphPathFn
GraphPathFn
appearance as argument number 1
(
documentation
GraphPathFn
ChineseLanguage
"这是一个
BinaryFunction
,它把两个
GraphNode
联系到这两个节点之间的
GraphPath
Class
。注:这两个
GraphNode
必须属于同一个
Graph
。")
chinese_format.kif 2376-2377
(
documentation
GraphPathFn
EnglishLanguage
"A
BinaryFunction
that maps two
GraphNode
s to the
Class
of
GraphPath
s between those two nodes. Note that the two
GraphNode
s must belong to the same
Graph
.")
Merge.kif 6059-6061
(
documentation
GraphPathFn
JapaneseLanguage
"
BinaryFunction
は、2つの
GraphNode
をこれ らの2つのノード間の
GraphPath
の
Class
にマップする。 注:2つの
GraphNode
は同じ
Graph
に属している必要がある。")
japanese_format.kif 1053-1055
(
domain
GraphPathFn
1
GraphNode
)
Merge.kif 6055-6055
Le nombre 1 argument de
GraphPathFn
est une
instance
de
noeud du graph
(
domain
GraphPathFn
2
GraphNode
)
Merge.kif 6056-6056
Le nombre 2 argument de
GraphPathFn
est une
instance
de
noeud du graph
(
instance
GraphPathFn
BinaryFunction
)
Merge.kif 6053-6053
GraphPathFn
est une
instance
de
fonction binaire
(
instance
GraphPathFn
TotalValuedRelation
)
Merge.kif 6054-6054
GraphPathFn
est une
instance
de
relation total
(
rangeSubclass
GraphPathFn
GraphPath
)
Merge.kif 6057-6057
Les valeurs retourn�es par
GraphPathFn
sont des
sous
-classes de
chemin du graph
appearance as argument number 2
(
format
ChineseLanguage
GraphPathFn
"%1 和 %2 的路径集
Set
")
chinese_format.kif 775-775
(
format
EnglishLanguage
GraphPathFn
"the set of paths between %1 and %2")
english_format.kif 775-775
(
format
FrenchLanguage
GraphPathFn
"l' ensemble de chemin entre %1 et %2")
french_format.kif 467-467
(
format
ItalianLanguage
GraphPathFn
"l' insieme di cammini tra %1 e %2")
relations-it.txt 120-120
(
format
JapaneseLanguage
GraphPathFn
"%1 と %2 間のパスの set")
japanese_format.kif 2171-2171
(
format
PortugueseLanguage
GraphPathFn
"o conjunto de caminhos entre %1 e %2")
portuguese_format.kif 419-419
(
format
de
GraphPathFn
"die menge von Pfaden zwischen %1 und %2")
relations-de.txt 1003-1003
(
format
hi
GraphPathFn
"%1 aura %2 ke biicha ke
path
asamuuha")
relations-hindi.txt 160-160
(
format
ro
GraphPathFn
"set%t{mulþimea} drumurilor între %1 ºi %2")
relations-ro.kif 489-489
(
format
sv
GraphPathFn
"mängden av vägar mellan %1 och %2")
relations-sv.txt 537-537
(
format
tg
GraphPathFn
"ang pangkat sa landas sa gitnang %1 at %2")
relations-tg.txt 247-247
(
termFormat
ChineseLanguage
GraphPathFn
"图形路径")
domainEnglishFormat.kif 26466-26466
(
termFormat
ChineseLanguage
GraphPathFn
"图路函数")
chinese_format.kif 776-776
(
termFormat
ChineseTraditionalLanguage
GraphPathFn
"圖形路徑")
domainEnglishFormat.kif 26465-26465
(
termFormat
EnglishLanguage
GraphPathFn
"graph path")
domainEnglishFormat.kif 26464-26464
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 6045-6051
Le
plus
grand
chemin
entre
noeud du graph
et
noeud du graph
est
chemin du graph
la
valeur
de
chemin du graph
est
nombre r�el
chemin du graph
2 est une
instance
de l'
ensemble
de chemin entre
noeud du graph
et
noeud du graph
la
valeur
de
chemin du graph
2 est
nombre r�el
nombre r�el
est plus
petit
ou �gal �
nombre r�el
(=>
(
and
(
equal
(
MinimalWeightedPathFn
?NODE1 ?NODE2) ?PATH)
(
equal
(
PathWeightFn
?PATH) ?NUMBER1)
(
instance
?PATH2
(
GraphPathFn
?NODE1 ?NODE2))
(
equal
(
PathWeightFn
?PATH2) ?NUMBER2))
(
greaterThanOrEqualTo
?NUMBER2 ?NUMBER1))
Merge.kif 6023-6029
Le
plus
petit
chemin
entre
noeud du graph
et
noeud du graph
est
chemin du graph
la
valeur
de
chemin du graph
est
nombre r�el
chemin du graph
2 est une
instance
de l'
ensemble
de chemin entre
noeud du graph
et
noeud du graph
la
valeur
de
chemin du graph
2 est
nombre r�el
nombre r�el
est
plus
grand
ou �gal �
nombre r�el
consequent
(=>
(
and
(
graphPart
?PATH ?GRAPH)
(
not
(
instance
?GRAPH
DirectedGraph
)))
(<=>
(
instance
?PATH
(
GraphPathFn
?NODE1 ?NODE2))
(
instance
?PATH
(
GraphPathFn
?NODE2 ?NODE1))))
Merge.kif 6063-6069
�lement du graph
Est une
partie
de
graph
graph
est une
instance
de
graph dirig�e
�lement du graph
est une
instance
de l'
ensemble
de chemin entre
noeud du graph
et
noeud du graph
�lement du graph
est une
instance
de l'
ensemble
de chemin entre
noeud du graph
et
noeud du graph
(=>
(
equal
(
MaximalWeightedPathFn
?NODE1 ?NODE2) ?PATH)
(
instance
?PATH
(
GraphPathFn
?NODE1 ?NODE2)))
Merge.kif 6041-6043
Le
plus
grand
chemin
entre
noeud du graph
et
noeud du graph
est
chemin du graph
chemin du graph
est une
instance
de l'
ensemble
de chemin entre
noeud du graph
et
noeud du graph
(=>
(
equal
(
MinimalWeightedPathFn
?NODE1 ?NODE2) ?PATH)
(
instance
?PATH
(
GraphPathFn
?NODE1 ?NODE2)))
Merge.kif 6019-6021
Le
plus
petit
chemin
entre
noeud du graph
et
noeud du graph
est
chemin du graph
chemin du graph
est une
instance
de l'
ensemble
de chemin entre
noeud du graph
et
noeud du graph
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