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
CutSetFn
Sigma KEE - CutSetFn
CutSetFn
appearance as argument number 1
(
documentation
CutSetFn
ChineseLanguage
"这是一个
UnaryFunction
,在要切开一个
Graph
的时候, 它会给这个图分配把它划分为两的
GraphPath
Class
。 同一个图可以有多种分割的组合。")
chinese_format.kif 2378-2379
(
documentation
CutSetFn
EnglishLanguage
"A
UnaryFunction
that assigns a
Graph
the
Class
of
GraphPath
s that partition the graph into two separate graphs if cut. There may be more than one cutset for a given graph.")
Merge.kif 6074-6076
(
documentation
CutSetFn
JapaneseLanguage
"
UnaryFunction
は、切り取るとグラフを2つの別々の グラフに分割する
GraphPath
の
Class
の
Graph
を割り当てる。特定のグラフに複数のカットセット がある場合がある。")
japanese_format.kif 1056-1058
(
domain
CutSetFn
1
Graph
)
Merge.kif 6071-6071
The number 1 argument of
cut set
is an
instance
of
graph
(
instance
CutSetFn
UnaryFunction
)
Merge.kif 6070-6070
Cut set
is an
instance
of
unary function
(
rangeSubclass
CutSetFn
GraphPath
)
Merge.kif 6072-6072
The values returned by
cut set
are
subclasses
of
graph path
appearance as argument number 2
(
format
ChineseLanguage
CutSetFn
"把 %1 分成另外两个图的路径
Set
")
chinese_format.kif 777-777
(
format
EnglishLanguage
CutSetFn
"the set of paths that partition %1 into two separate graphs")
english_format.kif 777-777
(
format
FrenchLanguage
CutSetFn
"l' ensemble de chemins qui partitionnent %1 en deux graph s�par�")
french_format.kif 468-468
(
format
ItalianLanguage
CutSetFn
"l' insieme di cammini che partiziona %1 in due grafi separati")
relations-it.txt 63-63
(
format
JapaneseLanguage
CutSetFn
"%1 を2つの別々のグラフに分割するパスの set")
japanese_format.kif 2172-2172
(
format
PortugueseLanguage
CutSetFn
"o conjunto de caminhos que dividem %1 em dois grafos distintos")
portuguese_format.kif 420-420
(
format
de
CutSetFn
"die menge von Pfaden die %1 in zwei verschiedene Graphen schnitten")
relations-de.txt 1006-1006
(
format
hi
CutSetFn
"vaha
path
asamuuha jo %1 ko vibhaajita karake do alaga-alaga graapha banaataa hai")
relations-hindi.txt 104-104
(
format
ro
CutSetFn
"set%t{mulþimea} drumurilor care partiþioneazã %1 în douã grafuri separate")
relations-ro.kif 490-490
(
format
sv
CutSetFn
"mängden av vägar som
partition
erar %1 i två separata grafer")
relations-sv.txt 538-538
(
format
tg
CutSetFn
"ang pulutong sa ang mga pinagdaraanan ng nagbabahagi %1 sa dalawang bukod na talaguhitan")
relations-tg.txt 142-142
(
format
tg
CutSetFn
"ang spulutong sa ang mga pinagdaraanan ng nagbabahagi %1 sa dalawang bukod na talaguhitan")
relations-cb.txt 97-97
(
relatedInternalConcept
MinimalCutSetFn
CutSetFn
)
Merge.kif 6081-6081
Minimal cut set
is
internally
related to
cut set
(
termFormat
ChineseLanguage
CutSetFn
"分图路径函数")
chinese_format.kif 778-778
(
termFormat
ChineseLanguage
CutSetFn
"切集")
domainEnglishFormat.kif 18222-18222
(
termFormat
ChineseTraditionalLanguage
CutSetFn
"切集")
domainEnglishFormat.kif 18221-18221
(
termFormat
EnglishLanguage
CutSetFn
"cut set")
domainEnglishFormat.kif 18220-18220
(
termFormat
tg
CutSetFn
"tungkulin pulutong sa ang mga pinagdaraanan ng nagbabahagi")
relations-tg.txt 143-143
consequent
(=>
(
instance
?GRAPH
Graph
)
(
subclass
(
MinimalCutSetFn
?GRAPH)
(
CutSetFn
?GRAPH)))
Merge.kif 6087-6089
If
a graph
is an
instance
of
graph
,
then the
set
of minimal paths that partition
the graph
into two separate graphs is a
subclass
of the
set
of paths that partition
the graph
into two separate graphs
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
There don't exist
a graph path
and
another graph path
such that
the graph path
is an
instance
of the
set
of paths that partition
a graph
into two separate graphs and
the other graph path
is an
instance
of the
set
of minimal paths that partition
the graph
into two separate graphs and the
length
of
the graph path
is
a positive integer
and the
length
of
the other graph path
is
another positive integer
and
the positive integer
is
less
than
the other positive integer
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