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
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 5913-5916
(
domain
BeginNodeFn
1
GraphPath
)
Merge.kif 5909-5909
The number 1 argument of
begin node
is an
instance
of
graph path
(
instance
BeginNodeFn
TotalValuedRelation
)
Merge.kif 5908-5908
Begin node
is an
instance
of
total valued relation
(
instance
BeginNodeFn
UnaryFunction
)
Merge.kif 5907-5907
Begin node
is an
instance
of
unary function
(
range
BeginNodeFn
GraphNode
)
Merge.kif 5910-5910
The
range
of
begin node
is an instance of
graph node
(
relatedInternalConcept
BeginNodeFn
InitialNodeFn
)
Merge.kif 5911-5911
Begin node
is
internally
related to
initial node
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
(
termFormat
ChineseLanguage
BeginNodeFn
"开始节点")
domainEnglishFormat.kif 10575-10575
(
termFormat
ChineseLanguage
BeginNodeFn
"节点开端函数")
chinese_format.kif 766-766
(
termFormat
ChineseTraditionalLanguage
BeginNodeFn
"開始節點")
domainEnglishFormat.kif 10574-10574
(
termFormat
EnglishLanguage
BeginNodeFn
"begin node")
domainEnglishFormat.kif 10573-10573
antecedent
(=>
(
and
(
equal
(
BeginNodeFn
?GRAPH) ?NODE)
(
equal
(
EndNodeFn
?GRAPH) ?NODE))
(
instance
?GRAPH
GraphCircuit
))
Merge.kif 5732-5736
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 2806-2819
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 5597-5617
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 5725-5730
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