Browsing Interface
: Welcome guest :
log in
[
Home
| 
Graph
|  ]
KB:
SUMO
Language:
ChineseLanguage
ChinesePinyinWriting
ChineseSimplifiedWriting
ChineseTraditionalLanguage
EnglishLanguage
FrenchLanguage
GermanLanguage
Hindi
ItalianLanguage
JapaneseLanguage
PortugueseLanguage
SpanishLanguage
SwedishLanguage
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
BeginNodeFn
Sigma KEE - BeginNodeFn
BeginNodeFn
appearance as argument number 1
(
documentation
BeginNodeFn
ChineseLanguage
"这是一个
UnaryFunction
,它把一个
GraphPath
联系到
GraphPath
开端的
GraphNode
。注:跟
InitialNodeFn
不同 (把一个
GraphArc
和一个
GraphNode
联系),
BeginNodeFn
是一个总体的函数 - 每个
GraphPath
都有它的开端。")
chinese_format.kif 2362-2364
(
documentation
BeginNodeFn
EnglishLanguage
"A
UnaryFunction
that maps a
GraphPath
to the
GraphNode
that is the beginning of the
GraphPath
. Note that, unlike
InitialNodeFn
(which relates a
GraphArc
to a
GraphNode
),
BeginNodeFn
is a total function - every
GraphPath
has a beginning.")
Merge.kif 5971-5974
(
documentation
BeginNodeFn
JapaneseLanguage
"
UnaryFunction
は、
GraphPath
を
GraphPath
の先頭である
GraphNode
にマップする。 注:
InitialNodeFn
(
GraphArc
と
GraphNode
を関 連付ける) とは異なり、
BeginNodeFn
は完全な関数であり、すべての
GraphPath
には始まりがある。")
japanese_format.kif 1039-1041
(
domain
BeginNodeFn
1
GraphPath
)
Merge.kif 5967-5967
(
instance
BeginNodeFn
TotalValuedRelation
)
Merge.kif 5966-5966
(
instance
BeginNodeFn
UnaryFunction
)
Merge.kif 5965-5965
(
range
BeginNodeFn
GraphNode
)
Merge.kif 5968-5968
(
relatedInternalConcept
BeginNodeFn
InitialNodeFn
)
Merge.kif 5969-5969
appearance as argument number 2
(
format
ChineseLanguage
BeginNodeFn
"%1 的开端")
chinese_format.kif 765-765
(
format
EnglishLanguage
BeginNodeFn
"the beginning of %1")
english_format.kif 765-765
(
format
FrenchLanguage
BeginNodeFn
"le commencement de %1")
french_format.kif 462-462
(
format
ItalianLanguage
BeginNodeFn
"l' inizio di %1")
relations-it.txt 35-35
(
format
JapaneseLanguage
BeginNodeFn
"%1 の beginning")
japanese_format.kif 2166-2166
(
format
PortugueseLanguage
BeginNodeFn
"o comeco de %1")
portuguese_format.kif 414-414
(
format
cb
BeginNodeFn
"ang sugod sa %1")
relations-cb.txt 69-69
(
format
cz
BeginNodeFn
"the beginning of %1")
relations-cz.txt 475-475
(
format
de
BeginNodeFn
"der anfang von %1")
relations-de.txt 988-988
(
format
hi
BeginNodeFn
"%1 kaa praarambha-noda")
relations-hindi.txt 79-79
(
format
ro
BeginNodeFn
"beginning%t{începutul} lui %1")
relations-ro.kif 484-484
(
format
sv
BeginNodeFn
"början för %1")
relations-sv.txt 528-528
(
format
tg
BeginNodeFn
"ang simula sa %1")
relations-tg.txt 86-86
(
termFormat
ChineseLanguage
BeginNodeFn
"开始节点")
domainEnglishFormat.kif 10578-10578
(
termFormat
ChineseLanguage
BeginNodeFn
"节点开端函数")
chinese_format.kif 766-766
(
termFormat
ChineseTraditionalLanguage
BeginNodeFn
"開始節點")
domainEnglishFormat.kif 10577-10577
(
termFormat
EnglishLanguage
BeginNodeFn
"begin node")
domainEnglishFormat.kif 10576-10576
(
termFormat
de
BeginNodeFn
"BeginNullPunktFn")
terms-de.txt 302-302
(
termFormat
tg
BeginNodeFn
"tunkulin ng simula buko")
relations-tg.txt 87-87
antecedent
(=>
(
and
(
equal
(
BeginNodeFn
?GRAPH) ?NODE)
(
equal
(
EndNodeFn
?GRAPH) ?NODE))
(
instance
?GRAPH
GraphCircuit
))
Merge.kif 5790-5794
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 3404-3417
(=>
(
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 5655-5675
(=>
(
instance
?GRAPH
GraphCircuit
)
(
exists
(?NODE)
(
and
(
equal
(
BeginNodeFn
?GRAPH) ?NODE)
(
equal
(
EndNodeFn
?GRAPH) ?NODE))))
Merge.kif 5783-5788
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