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
subGraph
Sigma KEE - subGraph
subGraph
appearance as argument number 1
(
documentation
subGraph
ChineseLanguage
"这是形容两个
Graph
,而其中一个图是另外一个图的一部分时 的关系,(
subGraph
?GRAPH1 ?GRAPH2)的意思是 ?GRAPH1 是 ?GRAPH2 的一部分。")
chinese_format.kif 2351-2352
(
documentation
subGraph
EnglishLanguage
"The relation between two
Graph
s when one
Graph
is a part of the other. (
subGraph
?GRAPH1 ?GRAPH2) means that ?GRAPH1 is a part of ?GRAPH2.")
Merge.kif 5901-5903
(
documentation
subGraph
JapaneseLanguage
"一方の
Graph
がもう一方の
Graph
の一部である 場合の2つの
Graph
の関係。 (
subGraph
?GRAPH1 ?GRAPH2) とは、?GRAPH1が ?GRAPH2の一部である ことを意味する。")
japanese_format.kif 1027-1029
(
domain
subGraph
1
Graph
)
Merge.kif 5898-5898
Le nombre 1 argument de
subGraph
est une
instance
de
graph
(
domain
subGraph
2
Graph
)
Merge.kif 5899-5899
Le nombre 2 argument de
subGraph
est une
instance
de
graph
(
instance
subGraph
BinaryPredicate
)
Merge.kif 5895-5895
subGraph
est une
instance
de
pr�dicat binaire
(
instance
subGraph
ReflexiveRelation
)
Merge.kif 5896-5896
subGraph
est une
instance
de
relation r�flexive
(
instance
subGraph
TransitiveRelation
)
Merge.kif 5897-5897
subGraph
est une
instance
de
relation transitive
appearance as argument number 2
(
format
ChineseLanguage
subGraph
"%1 %n 是 %2 的
subGraph
")
chinese_format.kif 751-751
(
format
EnglishLanguage
subGraph
"%1 is %n a subgraph of %2")
english_format.kif 753-753
(
format
FrenchLanguage
subGraph
"%1 est %n un sous-graph de %2")
french_format.kif 453-453
(
format
ItalianLanguage
subGraph
"%1 è %n un sottografo di %2")
relations-it.txt 273-273
(
format
JapaneseLanguage
subGraph
"%1 は %2 の subgraph では %n")
japanese_format.kif 2161-2161
(
format
PortugueseLanguage
subGraph
"%1 e' %n um sub-grafo de %2")
portuguese_format.kif 405-405
(
format
cz
subGraph
"%1 %p{je} %n{nen�} podgrafem %2")
relations-cz.txt 466-466
(
format
de
subGraph
"%1 ist ein teilgraph von %2 %n{nicht}")
relations-de.txt 969-969
(
format
hi
subGraph
"%1 %2 kaa upagraapha %n hai")
relations-hindi.txt 310-310
(
format
ro
subGraph
"%1 %n{nu} este un subgraph%t{subgraf} al lui %2")
relations-ro.kif 475-475
(
format
sv
subGraph
"%1 är %n{inte} en subgraph av %2")
relations-sv.txt 518-518
(
format
tg
subGraph
"%1 %n ay ang talaguhitan mas baba ng %2")
relations-tg.txt 465-465
(
termFormat
ChineseLanguage
subGraph
"子图")
chinese_format.kif 752-752
(
termFormat
ChineseTraditionalLanguage
subGraph
"子圖")
domainEnglishFormat.kif 55727-55727
(
termFormat
EnglishLanguage
subGraph
"sub graph")
domainEnglishFormat.kif 55726-55726
antecedent
(=>
(
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 5979-5991
La
valeur
de
chemin du graph
est
nombre r�el
chemin du graph
est un
sous
-graph de
chemin du graph
arc du graph
est une
partie
de
chemin du graph
la
valeur
de
arc du graph
est
nombre r�el
�lement du graph
�lement du graph
est une
partie
de
chemin du graph
�lement du graph
est une
partie
de
chemin du graph
�lement du graph
est
arc du graph
nombre r�el
est
valeur
de
chemin du graph
+
nombre r�el
)
(=>
(
and
(
subGraph
?GRAPH1 ?GRAPH2)
(
graphPart
?ELEMENT ?GRAPH1))
(
graphPart
?ELEMENT ?GRAPH2))
Merge.kif 5905-5909
Graph
est un
sous
-graph de
graph
�lement du graph
est une
partie
de
graph
�lement du graph
est une
partie
de
graph
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
distanceOnPath
quantit� constante
and
Transitway
pathInSystem
Transitway
and
TransitSystem
routeStart
r�gion
and
Transitway
routeEnd
r�gion
and
Transitway
abstractCounterpart
chemin du graph
and
TransitSystem
graph
noeud du graph
and
noeud du graph
graph
est un
sous
-graph de
chemin du graph
noeud du graph
est
commencement
de
chemin du graph
noeud du graph
est
fin
de
chemin du graph
abstractCounterpart
noeud du graph
and
r�gion
abstractCounterpart
noeud du graph
and
r�gion
(=>
(
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 5630-5650
Graph
est une
instance
de
graph
noeud du graph
est une
instance
de
noeud du graph
noeud du graph
est une
instance
de
noeud du graph
noeud du graph
est une
partie
de
graph
noeud du graph
est une
partie
de
graph
noeud du graph
est
noeud du graph
arc du graph
chemin du graph
arc du graph
lie
noeud du graph
et
noeud du graph
chemin du graph
est un
sous
-graph de
graph
chemin du graph
est une
instance
de
chemin du graph
le
commencement
de
chemin du graph
est
noeud du graph
la
fin
de
chemin du graph
est
noeud du graph
le
commencement
de
chemin du graph
est
noeud du graph
la
fin
de
chemin du graph
est
noeud du 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