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
MinimalCutSetFn
Sigma KEE - MinimalCutSetFn
MinimalCutSetFn
appearance as argument number 1
(
documentation
MinimalCutSetFn
ChineseLanguage
"这是一个
UnaryFunction
,它以最少条
GraphArc
把一个
Graph
划分的分割组合,给这个
Graph
分配
GraphPath
Class
。")
chinese_format.kif 2380-2381
(
documentation
MinimalCutSetFn
EnglishLanguage
"A
UnaryFunction
that assigns a
Graph
the
Class
of
GraphPath
s which comprise cutsets for the
Graph
and which have the least number of
GraphArc
s.")
Merge.kif 6083-6085
(
documentation
MinimalCutSetFn
JapaneseLanguage
"
UnaryFunction
は、
Graph
のカットセット を構成し、
GraphArc
の数が最も少ない
GraphPath
の
Graph
Class
を割り当てる。")
japanese_format.kif 1059-1060
(
domain
MinimalCutSetFn
1
Graph
)
Merge.kif 6079-6079
Le nombre 1 argument de
MinimalCutSetFn
est une
instance
de
graph
(
instance
MinimalCutSetFn
UnaryFunction
)
Merge.kif 6078-6078
MinimalCutSetFn
est une
instance
de
function unaire
(
rangeSubclass
MinimalCutSetFn
GraphPath
)
Merge.kif 6080-6080
Les valeurs retourn�es par
MinimalCutSetFn
sont des
sous
-classes de
chemin du graph
(
relatedInternalConcept
MinimalCutSetFn
CutSetFn
)
Merge.kif 6081-6081
MinimalCutSetFn
est
reli
� � l'int�rieur de SUMO �
CutSetFn
appearance as argument number 2
(
format
ChineseLanguage
MinimalCutSetFn
"把 %1 分成另外两个图的最短路径
Set
")
chinese_format.kif 779-779
(
format
EnglishLanguage
MinimalCutSetFn
"the set of minimal paths that partition %1 into two separate graphs")
english_format.kif 779-779
(
format
FrenchLanguage
MinimalCutSetFn
"l' ensemble minimal de chemins qui partitionnent %1 en deux graph s�par�")
french_format.kif 469-469
(
format
ItalianLanguage
MinimalCutSetFn
"l' insieme di cammini minimi che partiziona %1in due separati grafi")
relations-it.txt 189-189
(
format
JapaneseLanguage
MinimalCutSetFn
"%1 を2つの別々のグラフに分割する最小パスの set")
japanese_format.kif 2173-2173
(
format
PortugueseLanguage
MinimalCutSetFn
"o conjunto minimal de caminhos que dividem %1 em dois grafos distintos")
portuguese_format.kif 421-421
(
format
de
MinimalCutSetFn
"die menge von minimalen Pfaden die %1 in zwei verschiedene Graphen schnitten")
relations-de.txt 1009-1009
(
format
hi
MinimalCutSetFn
"vaha nimnatama pathasamuuha jo %1 ko do alaga-alaga graaphon men vibhaajita karataa hai")
relations-hindi.txt 227-227
(
format
ro
MinimalCutSetFn
"set%t{mulþimea} drumurilor minimale care partiþioneazã %1 în douã grafuri separate")
relations-ro.kif 491-491
(
format
sv
MinimalCutSetFn
"minimala mängden av vägar some
partition
erar %1 i två separata grafer")
relations-sv.txt 539-539
(
termFormat
ChineseLanguage
MinimalCutSetFn
"分最短图路径函数")
chinese_format.kif 780-780
(
termFormat
ChineseLanguage
MinimalCutSetFn
"最小割集")
domainEnglishFormat.kif 37865-37865
(
termFormat
ChineseTraditionalLanguage
MinimalCutSetFn
"最小割集")
domainEnglishFormat.kif 37864-37864
(
termFormat
EnglishLanguage
MinimalCutSetFn
"minimal cut set")
domainEnglishFormat.kif 37863-37863
antecedent
(=>
(
equal
(
MinimalCutSetFn
?GRAPH) ?PATHCLASS)
(
exists
(?NUMBER)
(
forall
(?PATH)
(=>
(
instance
?PATH ?PATHCLASS)
(
pathLength
?PATH ?NUMBER)))))
Merge.kif 6091-6097
L'
ensemble
minimal de chemins qui partitionnent
graph
en deux graph s�par� est
chemin du graph
nombre entier positif
chemin du graph
chemin du graph
est une
instance
de
chemin du graph
la
longueur
de
chemin du graph
est
nombre entier positif
consequent
(=>
(
instance
?GRAPH
Graph
)
(
subclass
(
MinimalCutSetFn
?GRAPH)
(
CutSetFn
?GRAPH)))
Merge.kif 6087-6089
Graph
est une
instance
de
graph
l'
ensemble
minimal de chemins qui partitionnent
graph
en deux graph s�par� est une
sous
-classe de l'
ensemble
de chemins qui partitionnent
graph
en deux graph s�par�
statement
(
not
(
exists
(?PATH1 ?PATH2)
(
and
(
instance
?PATH1
(
CutSetFn
?GRAPH))
(
instance
?PATH2
(
MinimalCutSetFn
?GRAPH))
(
pathLength
?PATH1 ?NUMBER1)
(
pathLength
?PATH2 ?NUMBER2)
(
lessThan
?NUMBER1 ?NUMBER2))))
Merge.kif 6099-6106
Chemin du graph
chemin du graph
chemin du graph
est une
instance
de l'
ensemble
de chemins qui partitionnent
graph
en deux graph s�par�
chemin du graph
est une
instance
de l'
ensemble
minimal de chemins qui partitionnent
graph
en deux graph s�par� la
longueur
de
chemin du graph
est
nombre entier positif
la
longueur
de
chemin du graph
est
nombre entier positif
nombre entier positif
est
moins
que
nombre entier positif
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