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
InitialNodeFn
Sigma KEE - InitialNodeFn
InitialNodeFn
appearance as argument number 1
(
documentation
InitialNodeFn
ChineseLanguage
"这是一个
UnaryFunction
,它把一个
GraphArc
和这个
GraphArc
的始点联系起来。 注:这是一个部分函数,特别是当
GraphArc
不属于
DirectedGraph
时,这会是个为定义的函数。")
chinese_format.kif 2356-2358
(
documentation
InitialNodeFn
EnglishLanguage
"A
UnaryFunction
that maps a
GraphArc
to the initial node of the
GraphArc
. Note that this is a partial function. In particular, the function is undefined for
GraphArc
s that are not part of a
DirectedGraph
.")
Merge.kif 5925-5928
(
documentation
InitialNodeFn
JapaneseLanguage
"
UnaryFunction
は、
GraphArc
を
GraphArc
の初期ノードにマップする。 注:これは部分的な関数。特に、
DirectedGraph
の一部ではない
GraphArc
の関数は未定義である。")
japanese_format.kif 1033-1035
(
domain
InitialNodeFn
1
GraphArc
)
Merge.kif 5922-5922
The number 1 argument of
initial node
is an
instance
of
graph arc
(
instance
InitialNodeFn
PartialValuedRelation
)
Merge.kif 5921-5921
Initial node
is an
instance
of
partial valued relation
(
instance
InitialNodeFn
UnaryFunction
)
Merge.kif 5920-5920
Initial node
is an
instance
of
unary function
(
range
InitialNodeFn
GraphNode
)
Merge.kif 5923-5923
The
range
of
initial node
is an instance of
graph node
appearance as argument number 2
(
format
ChineseLanguage
InitialNodeFn
"%1 节点的起点")
chinese_format.kif 761-761
(
format
EnglishLanguage
InitialNodeFn
"the starting node of %1")
english_format.kif 761-761
(
format
FrenchLanguage
InitialNodeFn
"le noeud de d�part de %1")
french_format.kif 460-460
(
format
ItalianLanguage
InitialNodeFn
"il nodo iniziale di %1")
relations-it.txt 146-146
(
format
JapaneseLanguage
InitialNodeFn
"%1 の starting ノード")
japanese_format.kif 2164-2164
(
format
PortugueseLanguage
InitialNodeFn
"o no' initial %1")
portuguese_format.kif 412-412
(
format
de
InitialNodeFn
"das ausgangsnullpunkt von %1")
relations-de.txt 982-982
(
format
hi
InitialNodeFn
"%1 kii praarambhika bindu")
relations-hindi.txt 185-185
(
format
ro
InitialNodeFn
"nodul starting%t{iniþial} al lui %1")
relations-ro.kif 482-482
(
format
sv
InitialNodeFn
"den initiala noden för %1")
relations-sv.txt 526-526
(
format
tg
InitialNodeFn
"ang pasimula ng %1")
relations-tg.txt 296-296
(
relatedInternalConcept
BeginNodeFn
InitialNodeFn
)
Merge.kif 5944-5944
Begin node
is
internally
related to
initial node
(
termFormat
ChineseLanguage
InitialNodeFn
"初始节点")
domainEnglishFormat.kif 30127-30127
(
termFormat
ChineseLanguage
InitialNodeFn
"节点起点函数")
chinese_format.kif 762-762
(
termFormat
ChineseTraditionalLanguage
InitialNodeFn
"初始節點")
domainEnglishFormat.kif 30126-30126
(
termFormat
EnglishLanguage
InitialNodeFn
"initial node")
domainEnglishFormat.kif 30125-30125
(
termFormat
tg
InitialNodeFn
"tungkulin ng buko una")
relations-tg.txt 297-297
antecedent
(=>
(
and
(
equal
(
InitialNodeFn
?ARC) ?NODE)
(
equal
(
TerminalNodeFn
?ARC) ?NODE))
(
instance
?ARC
GraphLoop
))
Merge.kif 5866-5870
If the
starting
node of
a graph arc
is
equal
to
a graph node
and the
terminal
node of
the graph arc
is
equal
to
the graph node
,
then
the graph arc
is an
instance
of
graph loop
(=>
(
and
(
instance
?GRAPH
GraphPath
)
(
instance
?ARC
GraphArc
)
(
graphPart
?ARC ?GRAPH)
(
equal
(
InitialNodeFn
?ARC) ?NODE))
(
not
(
exists
(?OTHER)
(
and
(
equal
(
InitialNodeFn
?OTHER) ?NODE)
(
not
(
equal
?OTHER ?ARC))))))
Merge.kif 5726-5737
If
a graph
is an
instance
of
graph path
and
a graph arc
is an
instance
of
graph arc
and
the graph arc
is a
part
of
the graph
and the
starting
node of
the graph arc
is
equal
to
a graph node
,
then there doesn't exist
another graph arc
such that the
starting
node of
the other graph arc
is
equal
to
the graph node
and
the other graph arc
is not
equal
to
the graph arc
consequent
(=>
(
and
(
instance
?GRAPH
DirectedGraph
)
(
instance
?ARC
GraphArc
)
(
graphPart
?ARC ?GRAPH))
(
exists
(?NODE1 ?NODE2)
(
and
(
equal
(
InitialNodeFn
?ARC) ?NODE1)
(
equal
(
TerminalNodeFn
?ARC) ?NODE2))))
Merge.kif 5675-5683
If
a graph
is an
instance
of
directed graph
and
a graph arc
is an
instance
of
graph arc
and
the graph arc
is a
part
of
the graph
,
then there exist
a graph node
and
another graph node
such that the
starting
node of
the graph arc
is
equal
to
the graph node
and the
terminal
node of
the graph arc
is
equal
to
the other graph node
(=>
(
and
(
instance
?GRAPH
GraphPath
)
(
instance
?ARC
GraphArc
)
(
graphPart
?ARC ?GRAPH)
(
equal
(
InitialNodeFn
?ARC) ?NODE))
(
not
(
exists
(?OTHER)
(
and
(
equal
(
InitialNodeFn
?OTHER) ?NODE)
(
not
(
equal
?OTHER ?ARC))))))
Merge.kif 5726-5737
If
a graph
is an
instance
of
graph path
and
a graph arc
is an
instance
of
graph arc
and
the graph arc
is a
part
of
the graph
and the
starting
node of
the graph arc
is
equal
to
a graph node
,
then there doesn't exist
another graph arc
such that the
starting
node of
the other graph arc
is
equal
to
the graph node
and
the other graph arc
is not
equal
to
the graph arc
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