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
graphPart
WaterCloud
Sigma KEE - graphPart
graphPart
appearance as argument number 1
(
documentation
graphPart
ChineseLanguage
"这是
Graph
和它的部分之间的一个基本关系。 (
graphPart
?PART ?GRAPH) 的意思是 ?PART 是
Graph
?GRAPH 的一个
GraphArc
或
GraphNode
。")
chinese_format.kif 2349-2350
(
documentation
graphPart
EnglishLanguage
"A basic relation for
Graph
s and their parts. (
graphPart
?PART ?GRAPH) means that ?PART is a
GraphArc
or
GraphNode
of the
Graph
?GRAPH.")
Merge.kif 5892-5894
(
documentation
graphPart
JapaneseLanguage
"
Graph
とそのパーツの基本的な関係。(
graphPart
?PART ?GRAPH) とは、?PARTが
Graph
?GRAPH の
GraphArc
または
GraphNode
であることを 意味する。")
japanese_format.kif 1024-1026
(
domain
graphPart
1
GraphElement
)
Merge.kif 5889-5889
(
domain
graphPart
2
Graph
)
Merge.kif 5890-5890
(
instance
graphPart
AsymmetricRelation
)
Merge.kif 5886-5886
(
instance
graphPart
BinaryPredicate
)
Merge.kif 5885-5885
(
instance
graphPart
IrreflexiveRelation
)
Merge.kif 5888-5888
(
instance
graphPart
TotalValuedRelation
)
Merge.kif 5887-5887
appearance as argument number 2
(
format
ChineseLanguage
graphPart
"%1 %n 是 %2 的
part
")
chinese_format.kif 749-749
(
format
EnglishLanguage
graphPart
"%1 is %n a
part
of %2")
english_format.kif 751-751
(
format
FrenchLanguage
graphPart
"%1 est %n une
part
ie de %2")
french_format.kif 452-452
(
format
ItalianLanguage
graphPart
"%1 è %n una
part
e di %2")
relations-it.txt 119-119
(
format
JapaneseLanguage
graphPart
"%1 は %2 の
part
では %n")
japanese_format.kif 2160-2160
(
format
PortugueseLanguage
graphPart
"%1 e' %n uma &parte de %2")
portuguese_format.kif 404-404
(
format
cz
graphPart
"%1 %p{je} %n{nen�} ��st� %2")
relations-cz.txt 465-465
(
format
de
graphPart
"%1 ist ein teil von %2 %n{nicht}")
relations-de.txt 966-966
(
format
hi
graphPart
"%1 %2 kaa bhaaga %n hai")
relations-hindi.txt 159-159
(
format
ro
graphPart
"%1 %n{nu} este o
part
%t{parte} a kui %2")
relations-ro.kif 474-474
(
format
sv
graphPart
"%1 är %n{inte} en
de
l av %2")
relations-sv.txt 517-517
(
format
tg
graphPart
"%1 %n ay ang bahagi sa %2")
relations-tg.txt 246-246
(
termFormat
ChineseLanguage
graphPart
"图形部分")
chinese_format.kif 750-750
(
termFormat
ChineseTraditionalLanguage
graphPart
"圖形部分")
domainEnglishFormat.kif 26459-26459
(
termFormat
EnglishLanguage
graphPart
"graph part")
domainEnglishFormat.kif 26458-26458
antecedent
(=>
(
and
(
equal
(
PathWeightFn
?PATH) ?SUM)
(
graphPart
?ARC1 ?PATH)
(
graphPart
?ARC2 ?PATH)
(
arcWeight
?ARC1 ?NUMBER1)
(
arcWeight
?ARC2 ?NUMBER2)
(
forall
(?ARC3)
(=>
(
graphPart
?ARC3 ?PATH)
(
or
(
equal
?ARC3 ?ARC1)
(
equal
?ARC3 ?ARC2)))))
(
equal
(
PathWeightFn
?PATH)
(
AdditionFn
?NUMBER1 ?NUMBER2)))
Merge.kif 5994-6007
(=>
(
and
(
equal
(
PathWeightFn
?PATH) ?SUM)
(
subGraph
?SUBPATH ?PATH)
(
graphPart
?ARC1 ?PATH)
(
arcWeight
?ARC1 ?NUMBER1)
(
forall
(?ARC2)
(=>
(
graphPart
?ARC2 ?PATH)
(
or
(
graphPart
?ARC2 ?SUBPATH)
(
equal
?ARC2 ?ARC1)))))
(
equal
?SUM
(
AdditionFn
(
PathWeightFn
?SUBPATH) ?NUMBER1)))
Merge.kif 5980-5992
(=>
(
and
(
graphMeasure
?G ?M)
(
instance
?AN
GraphNode
)
(
graphPart
?AN ?G)
(
graphPart
?AA ?G)
(
instance
?AA
GraphArc
)
(
abstractCounterpart
?AN ?PN)
(
abstractCounterpart
?AA ?PA)
(
arcWeight
?AA ?N))
(
measure
?PA
(
MeasureFn
?N ?M)))
Merge.kif 6166-6177
(=>
(
and
(
graphPart
?ARC1 ?GRAPH)
(
graphPart
?ARC2 ?GRAPH)
(
graphPart
?NODE1 ?GRAPH)
(
graphPart
?NODE2 ?GRAPH)
(
links
?NODE1 ?NODE2 ?ARC1)
(
links
?NODE1 ?NODE2 ?ARC2)
(
not
(
equal
?ARC1 ?ARC2)))
(
instance
?GRAPH
MultiGraph
))
Merge.kif 5791-5800
(=>
(
and
(
graphPart
?PATH ?GRAPH)
(
not
(
instance
?GRAPH
DirectedGraph
)))
(<=>
(
instance
?PATH
(
GraphPathFn
?NODE1 ?NODE2))
(
instance
?PATH
(
GraphPathFn
?NODE2 ?NODE1))))
Merge.kif 6063-6069
(=>
(
and
(
instance
?GRAPH
DirectedGraph
)
(
instance
?ARC
GraphArc
)
(
graphPart
?ARC ?GRAPH))
(
exists
(?NODE1 ?NODE2)
(
and
(
equal
(
InitialNodeFn
?ARC) ?NODE1)
(
equal
(
TerminalNodeFn
?ARC) ?NODE2))))
Merge.kif 5676-5684
(=>
(
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 5631-5651
(=>
(
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 5727-5738
(=>
(
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 5740-5751
(=>
(
and
(
instance
?LOOP
GraphLoop
)
(
graphPart
?LOOP ?GRAPH))
(
instance
?GRAPH
PseudoGraph
))
Merge.kif 5814-5818
(=>
(
and
(
subGraph
?GRAPH1 ?GRAPH2)
(
graphPart
?ELEMENT ?GRAPH1))
(
graphPart
?ELEMENT ?GRAPH2))
Merge.kif 5906-5910
consequent
(=>
(
and
(
instance
?TS
TransitSystem
)
(
instance
?T
Transitway
)
(
abstractCounterpart
?G ?TS)
(
systemPart
?T ?TS))
(
exists
(?GA)
(
and
(
instance
?GA
GraphArc
)
(
abstractCounterpart
?GA ?T)
(
graphPart
?GA ?G))))
Transportation.kif 2879-2889
(=>
(
and
(
instance
?TS
TransitSystem
)
(
instance
?TJ
TransitwayJunction
)
(
abstractCounterpart
?G ?TS)
(
systemPart
?TJ ?TS))
(
exists
(?GN)
(
and
(
instance
?GN
GraphNode
)
(
abstractCounterpart
?GN ?TJ)
(
graphPart
?GN ?G))))
Transportation.kif 2891-2901
(=>
(
and
(
subGraph
?GRAPH1 ?GRAPH2)
(
graphPart
?ELEMENT ?GRAPH1))
(
graphPart
?ELEMENT ?GRAPH2))
Merge.kif 5906-5910
(=>
(
graphMeasure
?G ?M)
(
forall
(?AC)
(
and
(
graphPart
?AC ?G)
(
exists
(?PC)
(
abstractCounterpart
?AC ?PC)))))
Merge.kif 6158-6164
(=>
(
instance
?GRAPH
Graph
)
(
exists
(?NODE1 ?NODE2 ?NODE3 ?ARC1 ?ARC2)
(
and
(
graphPart
?NODE1 ?GRAPH)
(
graphPart
?NODE2 ?GRAPH)
(
graphPart
?NODE3 ?GRAPH)
(
graphPart
?ARC1 ?GRAPH)
(
graphPart
?ARC2 ?GRAPH)
(
links
?NODE1 ?NODE2 ?ARC1)
(
links
?NODE2 ?NODE3 ?ARC2)
(
not
(
equal
?NODE1 ?NODE2))
(
not
(
equal
?NODE2 ?NODE3))
(
not
(
equal
?NODE1 ?NODE3))
(
not
(
equal
?ARC1 ?ARC2)))))
Merge.kif 5653-5667
(=>
(
instance
?GRAPH
MultiGraph
)
(
exists
(?ARC1 ?ARC2 ?NODE1 ?NODE2)
(
and
(
graphPart
?ARC1 ?GRAPH)
(
graphPart
?ARC2 ?GRAPH)
(
graphPart
?NODE1 ?GRAPH)
(
graphPart
?NODE2 ?GRAPH)
(
links
?NODE1 ?NODE2 ?ARC1)
(
links
?NODE1 ?NODE2 ?ARC2)
(
not
(
equal
?ARC1 ?ARC2)))))
Merge.kif 5778-5789
(=>
(
instance
?GRAPH
PseudoGraph
)
(
exists
(?LOOP)
(
and
(
instance
?LOOP
GraphLoop
)
(
graphPart
?LOOP ?GRAPH))))
Merge.kif 5807-5812
(=>
(
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 5707-5717
(=>
(
instance
?GRAPH
Tree
)
(
not
(
exists
(?LOOP)
(
and
(
instance
?LOOP
GraphCircuit
)
(
graphPart
?LOOP ?GRAPH)))))
Merge.kif 5699-5705
(=>
(
instance
?GRAPH
Tree
)
(
not
(
exists
(?LOOP)
(
and
(
instance
?LOOP
GraphLoop
)
(
graphPart
?LOOP ?GRAPH)))))
Merge.kif 5691-5697
(=>
(
instance
?PART
GraphElement
)
(
exists
(?GRAPH)
(
and
(
instance
?GRAPH
Graph
)
(
graphPart
?PART ?GRAPH))))
Merge.kif 5826-5831
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