Browsing Interface
: Welcome guest :
log in
[
Home
|
Graph
| ]
KB:
SUMO
Language:
ChineseLanguage
ChinesePinyinWriting
ChineseSimplifiedWriting
ChineseTraditionalLanguage
EnglishLanguage
FrenchLanguage
GermanLanguage
Hindi
ItalianLanguage
JapaneseLanguage
PortugueseLanguage
SpanishLanguage
SwedishLanguage
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
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 5941-5943
(
documentation
graphPart
JapaneseLanguage
"
Graph
とそのパーツの基本的な関係。(
graphPart
?PART ?GRAPH) とは、?PARTが
Graph
?GRAPH の
GraphArc
または
GraphNode
であることを 意味する。")
japanese_format.kif 1024-1026
(
domain
graphPart
1
GraphElement
)
Merge.kif 5938-5938
The number 1 argument of
graph part
is an
instance
of
graph element
(
domain
graphPart
2
Graph
)
Merge.kif 5939-5939
The number 2 argument of
graph part
is an
instance
of
graph
(
instance
graphPart
AsymmetricRelation
)
Merge.kif 5935-5935
graph part
is an
instance
of
asymmetric relation
(
instance
graphPart
BinaryPredicate
)
Merge.kif 5934-5934
graph part
is an
instance
of
binary predicate
(
instance
graphPart
IrreflexiveRelation
)
Merge.kif 5937-5937
graph part
is an
instance
of
irreflexive relation
(
instance
graphPart
TotalValuedRelation
)
Merge.kif 5936-5936
graph part
is an
instance
of
total valued relation
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 26469-26469
(
termFormat
EnglishLanguage
graphPart
"graph part")
domainEnglishFormat.kif 26468-26468
(
termFormat
de
graphPart
"graphenTeil")
terms-de.txt 296-296
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 6043-6056
If
equal
the
value
of
a graph path
and
a real number
and
a graph arc
is a
part
of
the graph path
and
another graph arc
is a
part
of
the graph path
and the
value
of
the graph arc
is
another real number
and the
value
of
the other graph arc
is
a third real number
and for all
a graph element
if
the graph element
is a
part
of
the graph path
,
then
equal
the graph element
and
the graph arc
or
equal
the graph element
and
the other graph arc
,
then
equal
the
value
of
the graph path
and (
the other real number
and
the third real number
)
(=>
(
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 6029-6041
If
equal
the
value
of
a graph path
and
an integer
and
another graph path
is a
subgraph
of
the graph path
and
a graph arc
is a
part
of
the graph path
and the
value
of
the graph arc
is
a real number
and for all
a graph element
if
the graph element
is a
part
of
the graph path
,
then
the graph element
is a
part
of
the other graph path
or
equal
the graph element
and
the graph arc
,
then
equal
the integer
and (the
value
of
the other graph path
and
the real number
)
(=>
(
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 6215-6226
If
an unit of measure
is the
unit
in
a graph
and
a graph element
is an
instance
of
graph node
and
the graph element
is a
part
of
the graph
and
a graph arc
is a
part
of
the graph
and
the graph arc
is an
instance
of
graph arc
and the
abstract
counterpart
of
a physical
is
the graph element
and the
abstract
counterpart
of
another physical
is
the graph arc
and the
value
of
the graph arc
is
a real number
,
then the
measure
of
the other physical
is
the real number
the unit of measure
(s)
(=>
(
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 5840-5849
If
a graph arc
is a
part
of
a graph
and
another graph arc
is a
part
of
the graph
and
a graph node
is a
part
of
the graph
and
another graph node
is a
part
of
the graph
and
the graph arc
link
s
the graph node
and
the other graph node
and
the other graph arc
link
s
the graph node
and
the other graph node
and
equal
the graph arc
and
the other graph arc
,
then
the graph
is an
instance
of
multi graph
(=>
(
and
(
graphPart
?PATH ?GRAPH)
(
not
(
instance
?GRAPH
DirectedGraph
)))
(<=>
(
instance
?PATH
(
GraphPathFn
?NODE1 ?NODE2))
(
instance
?PATH
(
GraphPathFn
?NODE2 ?NODE1))))
Merge.kif 6112-6118
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 5725-5733
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
equal
the
starting
node of
the graph arc
and
the graph node
and
equal
the
terminal
node of
the graph arc
and
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 5680-5700
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
equal
the graph node
and
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
equal
the
beginning
of
the graph path
and
the graph node
and
equal
the
end
of
the graph path
and
the other graph node
or
equal
the
beginning
of
the graph path
and
the other graph node
and
equal
the
end
of
the graph path
and
the graph node
(=>
(
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 5776-5787
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
equal
the
starting
node of
the graph arc
and
a graph node
,
then there doesn't exist
another graph arc
such that
equal
the
starting
node of
the other graph arc
and
the graph node
and
equal
the other graph arc
and
the graph arc
(=>
(
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 5789-5800
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
equal
the
terminal
node of
the graph arc
and
a graph node
,
then there doesn't exist
another graph arc
such that
equal
the
terminal
node of
the other graph arc
and
the graph node
and
equal
the other graph arc
and
the graph arc
(=>
(
and
(
instance
?LOOP
GraphLoop
)
(
graphPart
?LOOP ?GRAPH))
(
instance
?GRAPH
PseudoGraph
))
Merge.kif 5863-5867
If
a graph element
is an
instance
of
graph loop
and
the graph element
is a
part
of
a graph
,
then
the graph
is an
instance
of
pseudo graph
(=>
(
and
(
subGraph
?GRAPH1 ?GRAPH2)
(
graphPart
?ELEMENT ?GRAPH1))
(
graphPart
?ELEMENT ?GRAPH2))
Merge.kif 5955-5959
If
a graph
is a
subgraph
of
another graph
and
a graph element
is a
part
of
the graph
,
then
the graph element
is a
part
of
the other graph
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 3443-3453
If
a physical system
is an
instance
of
transit system
and
a physical
is an
instance
of
transitway
and the
abstract
counterpart
of
the physical system
is
a graph
and
the physical system
is a
system
part of
the physical
,
then there exists
the graph
A such that
the graph
A is an
instance
of
graph arc
and the
abstract
counterpart
of
the physical
is
the graph
A and
the graph
A is a
part
of
the graph
(=>
(
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 3455-3465
If
a physical system
is an
instance
of
transit system
and
a physical
is an
instance
of
transitway junction
and the
abstract
counterpart
of
the physical system
is
a graph
and
the physical system
is a
system
part of
the physical
,
then there exists
the graph
N such that
the graph
N is an
instance
of
graph node
and the
abstract
counterpart
of
the physical
is
the graph
N and
the graph
N is a
part
of
the graph
(=>
(
and
(
subGraph
?GRAPH1 ?GRAPH2)
(
graphPart
?ELEMENT ?GRAPH1))
(
graphPart
?ELEMENT ?GRAPH2))
Merge.kif 5955-5959
If
a graph
is a
subgraph
of
another graph
and
a graph element
is a
part
of
the graph
,
then
the graph element
is a
part
of
the other graph
(=>
(
graphMeasure
?G ?M)
(
forall
(?AC)
(
and
(
graphPart
?AC ?G)
(
exists
(?PC)
(
abstractCounterpart
?AC ?PC)))))
Merge.kif 6207-6213
If
an unit of measure
is the
unit
in
a graph
,
then for all
a graph element
the graph element
is a
part
of
the graph
and there exists
a physical
such that the
abstract
counterpart
of
the physical
is
the graph element
(=>
(
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 5702-5716
If
a graph
is an
instance
of
graph
,
then there exist
a graph node
,
another graph node
,, ,
a third graph node
,, ,
a graph arc
and
another graph arc
such that
the graph node
is a
part
of
the graph
and
the other graph node
is a
part
of
the graph
and
the third graph node
is a
part
of
the graph
and
the graph arc
is a
part
of
the graph
and
the other graph arc
is a
part
of
the graph
and
the graph arc
link
s
the graph node
and
the other graph node
and
the other graph arc
link
s
the other graph node
and
the third graph node
and
equal
the graph node
and
the other graph node
and
equal
the other graph node
and
the third graph node
and
equal
the graph node
and
the third graph node
and
equal
the graph arc
and
the other graph arc
(=>
(
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 5827-5838
If
a graph
is an
instance
of
multi graph
,
then there exist
a graph arc
,
another graph arc
,, ,
a graph node
and
another 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 other graph node
is a
part
of
the graph
and
the graph arc
link
s
the graph node
and
the other graph node
and
the other graph arc
link
s
the graph node
and
the other graph node
and
equal
the graph arc
and
the other graph arc
(=>
(
instance
?GRAPH
PseudoGraph
)
(
exists
(?LOOP)
(
and
(
instance
?LOOP
GraphLoop
)
(
graphPart
?LOOP ?GRAPH))))
Merge.kif 5856-5861
If
a graph
is an
instance
of
pseudo graph
,
then there exists
a graph element
such that
the graph element
is an
instance
of
graph loop
and
the graph element
is a
part
of
the graph
(=>
(
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 5756-5766
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
equal
the
terminal
node of
the graph arc
and
the graph node
and
equal
the
terminal
node of
the other graph arc
and
the graph node
and
equal
the graph arc
and
the other graph arc
(=>
(
instance
?GRAPH
Tree
)
(
not
(
exists
(?LOOP)
(
and
(
instance
?LOOP
GraphCircuit
)
(
graphPart
?LOOP ?GRAPH)))))
Merge.kif 5748-5754
If
a graph
is an
instance
of
tree
,
then there doesn't exist
a graph element
such that
the graph element
is an
instance
of
graph circuit
and
the graph element
is a
part
of
the graph
(=>
(
instance
?GRAPH
Tree
)
(
not
(
exists
(?LOOP)
(
and
(
instance
?LOOP
GraphLoop
)
(
graphPart
?LOOP ?GRAPH)))))
Merge.kif 5740-5746
If
a graph
is an
instance
of
tree
,
then there doesn't exist
a graph element
such that
the graph element
is an
instance
of
graph loop
and
the graph element
is a
part
of
the graph
(=>
(
instance
?PART
GraphElement
)
(
exists
(?GRAPH)
(
and
(
instance
?GRAPH
Graph
)
(
graphPart
?PART ?GRAPH))))
Merge.kif 5875-5880
If
a graph element
is an
instance
of
graph element
,
then there exists
a graph
such that
the graph
is an
instance
of
graph
and
the graph element
is a
part
of
the graph
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
