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
LightRoast
Sigma KEE - EndNodeFn
EndNodeFn
appearance as argument number 1
(
documentation
EndNodeFn
ChineseLanguage
"这是一个
UnaryFunction
,它把一个
GraphPath
和
GraphPath
末端的
GraphNode
。注:和
TerminalNodeFn
不同 (把一个
GraphArc
和一个
GraphNode
联系),
EndNodeFn
是一个总体的函数 - 每个
GraphPath
都有它的末端。")
chinese_format.kif 2365-2367
(
documentation
EndNodeFn
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 5957-5960
(
documentation
EndNodeFn
JapaneseLanguage
"
UnaryFunction
は、
GraphPath
を
GraphPath
の 終わりである
GraphNode
にマップする。 注:
TerminalNodeFn
(
GraphArc
を
GraphNode
に関 連する)とは異なり、
EndNodeFn
は合計関数であり、すべての
GraphPath
には終わりがある。")
japanese_format.kif 1042-1044
(
domain
EndNodeFn
1
GraphPath
)
Merge.kif 5953-5953
Le nombre 1 argument de
EndNodeFn
est une
instance
de
chemin du graph
(
instance
EndNodeFn
TotalValuedRelation
)
Merge.kif 5952-5952
EndNodeFn
est une
instance
de
relation total
(
instance
EndNodeFn
UnaryFunction
)
Merge.kif 5951-5951
EndNodeFn
est une
instance
de
function unaire
(
range
EndNodeFn
GraphNode
)
Merge.kif 5954-5954
Le
domaine
de
EndNodeFn
est une instance de
noeud du graph
(
relatedInternalConcept
EndNodeFn
TerminalNodeFn
)
Merge.kif 5955-5955
EndNodeFn
est
reli
� � l'int�rieur de SUMO �
TerminalNodeFn
appearance as argument number 2
(
format
ChineseLanguage
EndNodeFn
"%1 的末端")
chinese_format.kif 767-767
(
format
EnglishLanguage
EndNodeFn
"the end of %1")
english_format.kif 767-767
(
format
FrenchLanguage
EndNodeFn
"la fin de %1")
french_format.kif 463-463
(
format
ItalianLanguage
EndNodeFn
"la fine di %1")
relations-it.txt 93-93
(
format
JapaneseLanguage
EndNodeFn
"%1 の end")
japanese_format.kif 2167-2167
(
format
PortugueseLanguage
EndNodeFn
"o fim de %1")
portuguese_format.kif 415-415
(
format
cz
EndNodeFn
"the end of %1")
relations-cz.txt 476-476
(
format
de
EndNodeFn
"das ende von %1")
relations-de.txt 991-991
(
format
hi
EndNodeFn
"%1 kaa antima-bindu")
relations-hindi.txt 133-133
(
format
ro
EndNodeFn
"end{sfârºtul} lui %1")
relations-ro.kif 485-485
(
format
sv
EndNodeFn
"slutet för %1")
relations-sv.txt 530-530
(
format
tg
EndNodeFn
"ang dulo sa %1")
relations-tg.txt 201-201
(
termFormat
ChineseLanguage
EndNodeFn
"结束节点")
domainEnglishFormat.kif 22048-22048
(
termFormat
ChineseLanguage
EndNodeFn
"节点末端")
chinese_format.kif 768-768
(
termFormat
ChineseTraditionalLanguage
EndNodeFn
"結束節點")
domainEnglishFormat.kif 22047-22047
(
termFormat
EnglishLanguage
EndNodeFn
"end node")
domainEnglishFormat.kif 22046-22046
(
termFormat
tg
EndNodeFn
"tungkulin ng dulo buko")
relations-tg.txt 202-202
antecedent
(=>
(
and
(
equal
(
BeginNodeFn
?GRAPH) ?NODE)
(
equal
(
EndNodeFn
?GRAPH) ?NODE))
(
instance
?GRAPH
GraphCircuit
))
Merge.kif 5765-5769
Le
commencement
de
chemin du graph
est
noeud du graph
la
fin
de
chemin du graph
est
noeud du graph
chemin du graph
est une
instance
de
circuit du graph
consequent
(=>
(
and
(
distanceOnPath
?DIST ?PATH)
(
pathInSystem
?PATH ?SYS)
(
routeStart
?START ?PATH)
(
routeEnd
?END ?PATH)
(
abstractCounterpart
?GRAPH ?SYS))
(
exists
(?S ?BN ?EN)
(
and
(
subGraph
?S ?GRAPH)
(
equal
?BN
(
BeginNodeFn
?GRAPH))
(
equal
?EN
(
EndNodeFn
?GRAPH))
(
abstractCounterpart
?BN ?START)
(
abstractCounterpart
?EN ?END))))
Transportation.kif 2806-2819
distanceOnPath
quantit� constante
and
Transitway
pathInSystem
Transitway
and
TransitSystem
routeStart
r�gion
and
Transitway
routeEnd
r�gion
and
Transitway
abstractCounterpart
chemin du graph
and
TransitSystem
graph
noeud du graph
and
noeud du graph
graph
est un
sous
-graph de
chemin du graph
noeud du graph
est
commencement
de
chemin du graph
noeud du graph
est
fin
de
chemin du graph
abstractCounterpart
noeud du graph
and
r�gion
abstractCounterpart
noeud du graph
and
r�gion
(=>
(
and
(
instance
?GRAPH
Graph
)
(
instance
?NODE1
GraphNode
)
(
instance
?NODE2
GraphNode
)
(
graphPart
?NODE1 ?GRAPH)
(
graphPart
?NODE2 ?GRAPH)
(
not
(
equal
?NODE1 ?NODE2)))
(
exists
(?ARC ?PATH)
(
or
(
links
?NODE1 ?NODE2 ?ARC)
(
and
(
subGraph
?PATH ?GRAPH)
(
instance
?PATH
GraphPath
)
(
or
(
and
(
equal
(
BeginNodeFn
?PATH) ?NODE1)
(
equal
(
EndNodeFn
?PATH) ?NODE2))
(
and
(
equal
(
BeginNodeFn
?PATH) ?NODE2)
(
equal
(
EndNodeFn
?PATH) ?NODE1)))))))
Merge.kif 5630-5650
Graph
est une
instance
de
graph
noeud du graph
est une
instance
de
noeud du graph
noeud du graph
est une
instance
de
noeud du graph
noeud du graph
est une
partie
de
graph
noeud du graph
est une
partie
de
graph
noeud du graph
est
noeud du graph
arc du graph
chemin du graph
arc du graph
lie
noeud du graph
et
noeud du graph
chemin du graph
est un
sous
-graph de
graph
chemin du graph
est une
instance
de
chemin du graph
le
commencement
de
chemin du graph
est
noeud du graph
la
fin
de
chemin du graph
est
noeud du graph
le
commencement
de
chemin du graph
est
noeud du graph
la
fin
de
chemin du graph
est
noeud du graph
(=>
(
instance
?GRAPH
GraphCircuit
)
(
exists
(?NODE)
(
and
(
equal
(
BeginNodeFn
?GRAPH) ?NODE)
(
equal
(
EndNodeFn
?GRAPH) ?NODE))))
Merge.kif 5758-5763
Chemin du graph
est une
instance
de
circuit du graph
noeud du graph
le
commencement
de
chemin du graph
est
noeud du graph
la
fin
de
chemin du graph
est
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