Browsing Interface
: Welcome guest :
log in
[
Home
| 
Graph
|  ]
KB:
SUMO
Language:
ChineseLanguage
ChinesePinyinWriting
ChineseSimplifiedWriting
ChineseTraditionalLanguage
EnglishLanguage
FrenchLanguage
GermanLanguage
JapaneseLanguage
SpanishLanguage
SwedishLanguage
Formal Language:
OWL
SUO-KIF
TPTP
traditionalLogic
KB Term:
Term intersection
English Word:
Any
Noun
Verb
Adjective
Adverb
EndNodeFn
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 5855-5858
(
domain
EndNodeFn
1
GraphPath
)
Merge.kif 5851-5851
The number 1 argument of
end node
is an
instance
of
graph path
(
instance
EndNodeFn
TotalValuedRelation
)
Merge.kif 5850-5850
End node
is an
instance
of
total valued relation
(
instance
EndNodeFn
UnaryFunction
)
Merge.kif 5849-5849
End node
is an
instance
of
unary function
(
range
EndNodeFn
GraphNode
)
Merge.kif 5852-5852
The
range
of
end node
is an instance of
graph node
(
relatedInternalConcept
EndNodeFn
TerminalNodeFn
)
Merge.kif 5853-5853
End node
is
internally
related to
terminal node
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
(
termFormat
ChineseLanguage
EndNodeFn
"结束节点")
domainEnglishFormat.kif 22041-22041
(
termFormat
ChineseLanguage
EndNodeFn
"节点末端")
chinese_format.kif 768-768
(
termFormat
ChineseTraditionalLanguage
EndNodeFn
"結束節點")
domainEnglishFormat.kif 22040-22040
(
termFormat
EnglishLanguage
EndNodeFn
"end node")
domainEnglishFormat.kif 22039-22039
antecedent
(=>
(
and
(
equal
(
BeginNodeFn
?GRAPH) ?NODE)
(
equal
(
EndNodeFn
?GRAPH) ?NODE))
(
instance
?GRAPH
GraphCircuit
))
Merge.kif 5663-5667
If the
beginning
of
a graph path
is
equal
to
a graph node
and the
end
of
the graph path
is
equal
to
the graph node
,
then
the graph path
is an
instance
of
graph circuit
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 2813-2826
If the
distance
of
a transitway
is
a constant quantity
and
a transit system
is a
path
in system of
the transitway
and
a region
is the
start
of
the transitway
and
another region
is the
end
of
the transitway
and the
abstract
counterpart
of
the transit system
is
a graph path
,
then there exist
a graph
,
a graph node
and
another graph node
such that
the graph
is a
subgraph
of
the graph path
and
the graph node
is
equal
to the
beginning
of
the graph path
and
the other graph node
is
equal
to the
end
of
the graph path
and the
abstract
counterpart
of
the region
is
the graph node
and the
abstract
counterpart
of
the other region
is
the other graph node
(=>
(
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 5530-5550
If
a graph
is an
instance
of
graph
and
a graph node
is an
instance
of
graph node
and
another graph node
is an
instance
of
graph node
and
the graph node
is a
part
of
the graph
and
the other graph node
is a
part
of
the graph
and
the graph node
is not
equal
to
the other graph node
,
then there exist
a graph arc
and
a graph path
such that
the graph arc
link
s
the graph node
and
the other graph node
or
the graph path
is a
subgraph
of
the graph
and
the graph path
is an
instance
of
graph path
and the
beginning
of
the graph path
is
equal
to
the graph node
and the
end
of
the graph path
is
equal
to
the other graph node
or the
beginning
of
the graph path
is
equal
to
the other graph node
and the
end
of
the graph path
is
equal
to
the graph node
(=>
(
instance
?GRAPH
GraphCircuit
)
(
exists
(?NODE)
(
and
(
equal
(
BeginNodeFn
?GRAPH) ?NODE)
(
equal
(
EndNodeFn
?GRAPH) ?NODE))))
Merge.kif 5656-5661
If
a graph path
is an
instance
of
graph circuit
,
then there exists
a graph node
such that the
beginning
of
the graph path
is
equal
to
the graph node
and the
end
of
the graph path
is
equal
to
the graph node
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