Browsing Interface
: Welcome guest :
log in
[
Home

Graph
 ]
KB:
SUMO
Language:
ChineseLanguage
ChinesePinyinWriting
ChineseSimplifiedWriting
ChineseTraditionalLanguage
EnglishLanguage
FrenchLanguage
GermanLanguage
JapaneseLanguage
SpanishLanguage
SwedishLanguage
Formal Language:
OWL
SUOKIF
TPTP
traditionalLogic
KB Term:
Term intersection
English Word:
Any
Noun
Verb
Adjective
Adverb
DirectedGraph
Sigma KEE  DirectedGraph
DirectedGraph
(directed graph)
appearance as argument number 1
(
documentation
DirectedGraph
ChineseLanguage
"这是有向图的
Class
，有向图的所有
GraphArc
都 有方向，即是每一个
GraphArc
有一个始点(可参考
InitialNodeFn
)和一个终点(可参考
TerminalNodeFn
)。")
chinese_format.kif 23262328
(
documentation
DirectedGraph
EnglishLanguage
"The
Class
of directed graphs. A directed graph is a
Graph
in which all
GraphArc
s have direction, i.e. every
GraphArc
has an initial node (see
InitialNodeFn
) and a terminal node (see
TerminalNodeFn
).")
Merge.kif 56015604
(
externalImage
DirectedGraph
"http://upload.wikimedia.org/wikipedia/commons/ a/ a2/ Directed.svg")
pictureList.kif 17291729
(
subclass
DirectedGraph
Graph
)
Merge.kif 55995599
Directed graph
is a
subclass
of
graph
appearance as argument number 2
(
subclass
GraphPath
DirectedGraph
)
Merge.kif 56495649
Graph path
is a
subclass
of
directed graph
(
subclass
Tree
DirectedGraph
)
Merge.kif 56165616
Tree
is a
subclass
of
directed graph
(
termFormat
ChineseLanguage
DirectedGraph
"有向图")
chinese_format.kif 934934
(
termFormat
EnglishLanguage
DirectedGraph
"directed graph")
english_format.kif 10751075
antecedent
(=>
(
and
(
graphPart
?PATH ?GRAPH)
(
not
(
instance
?GRAPH
DirectedGraph
)))
(<=>
(
instance
?PATH
(
GraphPathFn
?NODE1 ?NODE2))
(
instance
?PATH
(
GraphPathFn
?NODE2 ?NODE1))))
Merge.kif 60016007
If
a graph element
is a
part
of
a graph
and
the graph
is not an
instance
of
directed graph
,
then
the graph element
is an
instance
of the
set
of paths between
a graph node
and
another graph node
if and only if
the graph element
is an
instance
of the
set
of paths between
the other graph node
and
the graph node
(=>
(
and
(
instance
?GRAPH
DirectedGraph
)
(
instance
?ARC
GraphArc
)
(
graphPart
?ARC ?GRAPH))
(
exists
(?NODE1 ?NODE2)
(
and
(
equal
(
InitialNodeFn
?ARC) ?NODE1)
(
equal
(
TerminalNodeFn
?ARC) ?NODE2))))
Merge.kif 56065614
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
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