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
TerminalNodeFn
Sigma KEE - TerminalNodeFn
TerminalNodeFn
appearance as argument number 1
(
documentation
TerminalNodeFn
ChineseLanguage
"这是一个
UnaryFunction
, 它把一个
GraphArc
和这个
GraphArc
的终点联系起来。 注:这是一个部分函数,特别是当
GraphArc
不属于
DirectedGraph
时,这会是个为定义的函数。")
chinese_format.kif 2359-2361
(
documentation
TerminalNodeFn
EnglishLanguage
"A
UnaryFunction
that maps a
GraphArc
to the terminal 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 5935-5938
(
documentation
TerminalNodeFn
JapaneseLanguage
"
UnaryFunction
は、
GraphArc
を
GraphArc
の端子ノードにマップする。 注:これは部分的な関数。特に、
DirectedGraph
の一部では ない
GraphArc
の関数は未定義である。")
japanese_format.kif 1036-1038
(
domain
TerminalNodeFn
1
GraphArc
)
Merge.kif 5932-5932
The number 1 argument of
terminal node
is an
instance
of
graph arc
(
instance
TerminalNodeFn
PartialValuedRelation
)
Merge.kif 5931-5931
Terminal node
is an
instance
of
partial valued relation
(
instance
TerminalNodeFn
UnaryFunction
)
Merge.kif 5930-5930
Terminal node
is an
instance
of
unary function
(
range
TerminalNodeFn
GraphNode
)
Merge.kif 5933-5933
The
range
of
terminal node
is an instance of
graph node
appearance as argument number 2
(
format
ChineseLanguage
TerminalNodeFn
"%1 节点的终点")
chinese_format.kif 763-763
(
format
EnglishLanguage
TerminalNodeFn
"the terminal node of %1")
english_format.kif 763-763
(
format
FrenchLanguage
TerminalNodeFn
"le noeud terminal %1")
french_format.kif 461-461
(
format
ItalianLanguage
TerminalNodeFn
"il nodo terminale di %1")
relations-it.txt 298-298
(
format
JapaneseLanguage
TerminalNodeFn
"%1 の terminal ノード")
japanese_format.kif 2165-2165
(
format
PortugueseLanguage
TerminalNodeFn
"o no' terminal %1")
portuguese_format.kif 413-413
(
format
de
TerminalNodeFn
"das terminalnullpunkt von %1")
relations-de.txt 985-985
(
format
hi
TerminalNodeFn
"%1 kaa antastha bindu")
relations-hindi.txt 334-334
(
format
ro
TerminalNodeFn
"nodul terminal%t{terminal} al lui %1")
relations-ro.kif 483-483
(
format
sv
TerminalNodeFn
"den terminerande noden för %1")
relations-sv.txt 527-527
(
format
tg
TerminalNodeFn
"ang buko ng pandulo %1")
relations-tg.txt 490-490
(
relatedInternalConcept
EndNodeFn
TerminalNodeFn
)
Merge.kif 5955-5955
End node
is
internally
related to
terminal node
(
termFormat
ChineseLanguage
TerminalNodeFn
"终端节点")
domainEnglishFormat.kif 57566-57566
(
termFormat
ChineseLanguage
TerminalNodeFn
"节点终点函数")
chinese_format.kif 764-764
(
termFormat
ChineseTraditionalLanguage
TerminalNodeFn
"終端節點")
domainEnglishFormat.kif 57565-57565
(
termFormat
EnglishLanguage
TerminalNodeFn
"terminal node")
domainEnglishFormat.kif 57564-57564
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
(
TerminalNodeFn
?ARC) ?NODE))
(
not
(
exists
(?OTHER)
(
and
(
equal
(
TerminalNodeFn
?OTHER) ?NODE)
(
not
(
equal
?OTHER ?ARC))))))
Merge.kif 5739-5750
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
terminal
node of
the graph arc
is
equal
to
a graph node
,
then there doesn't exist
another graph arc
such that the
terminal
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
(
TerminalNodeFn
?ARC) ?NODE))
(
not
(
exists
(?OTHER)
(
and
(
equal
(
TerminalNodeFn
?OTHER) ?NODE)
(
not
(
equal
?OTHER ?ARC))))))
Merge.kif 5739-5750
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
terminal
node of
the graph arc
is
equal
to
a graph node
,
then there doesn't exist
another graph arc
such that the
terminal
node of
the other graph arc
is
equal
to
the graph node
and
the other graph arc
is not
equal
to
the graph arc
(=>
(
instance
?GRAPH
Tree
)
(
not
(
exists
(?ARC1 ?ARC2 ?NODE)
(
and
(
graphPart
?ARC1 ?GRAPH)
(
graphPart
?ARC2 ?GRAPH)
(
graphPart
?NODE ?GRAPH)
(
equal
(
TerminalNodeFn
?ARC1) ?NODE)
(
equal
(
TerminalNodeFn
?ARC2) ?NODE)
(
not
(
equal
?ARC1 ?ARC2))))))
Merge.kif 5706-5716
If
a graph
is an
instance
of
tree
,
then there don't exist
a graph arc
,
another graph arc
and
a graph node
such that
the graph arc
is a
part
of
the graph
and
the other graph arc
is a
part
of
the graph
and
the graph node
is a
part
of
the graph
and the
terminal
node of
the graph arc
is
equal
to
the graph node
and the
terminal
node of
the other graph arc
is
equal
to
the graph node
and
the graph arc
is not
equal
to
the other 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