Browsing Interface
: Welcome guest :
log in
[
Home

Graph
 ]
KB:
SUMO
Language:
AlbanianLanguage
ArabicLanguage
BasqueLanguage
BulgarianLanguage
CatalanLanguage
ChineseLanguage
ChineseTraditionalLanguage
CroatianLanguage
DanishLanguage
EnglishLanguage
FarsiLanguage
FinnishLanguage
FrenchLanguage
GalicianLanguage
GreekLanguage
HebrewLanguage
IcelandicLanguage
IndonesianLanguage
ItalianLanguage
JapaneseLanguage
MalayLanguage
NorwegianBokmalLanguage
NorwegianNorskLanguage
PolishLanguage
PortugueseLanguage
SpanishLanguage
SwedishLanguage
TaiwanChineseLanguage
ThaiLanguage
de
Formal Language:
OWL
SUOKIF
TPTP
traditionalLogic
KB Term:
Term intersection
English Word:
Any
Noun
Verb
Adjective
Adverb
Sigma KEE  MinimalCutSetFn
MinimalCutSetFn
appearance as argument number 1
(
documentation
MinimalCutSetFn
ChineseLanguage
"这是一个
UnaryFunction
，它以最少条
GraphArc
把一个
Graph
划分的分割组合，给这个
Graph
分配
GraphPath
Class
。")
Merge.kif 62156216
(
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 62126214
(
domain
MinimalCutSetFn
1
Graph
)
Merge.kif 62096209
The number 1 argument of
minimal cut set
is an
instance
of
graph
(
instance
MinimalCutSetFn
UnaryFunction
)
Merge.kif 62086208
Minimal cut set
is an
instance
of
unary function
(
rangeSubclass
MinimalCutSetFn
GraphPath
)
Merge.kif 62106210
The values returned by
minimal cut set
are
subclasses
of
graph path
(
relatedInternalConcept
MinimalCutSetFn
CutSetFn
)
Merge.kif 62116211
Minimal cut set
is
internally
related to
cut set
appearance as argument number 2
(
format
ChineseLanguage
MinimalCutSetFn
"把 %1 分成另外两个图的最短路径
Set
")
chinese_format.kif 779779
(
format
EnglishLanguage
MinimalCutSetFn
"the set of minimal paths that partition %1 into two separate graphs")
english_format.kif 480480
(
termFormat
ChineseLanguage
MinimalCutSetFn
"分最短图路径函数")
chinese_format.kif 780780
"分最短图路径函数" is the
printable
form
of
minimal cut set
in
ChineseLanguage
(
termFormat
EnglishLanguage
MinimalCutSetFn
"minimal cut set")
domainEnglishFormat.kif 67316731
"minimal cut set" is the
printable
form
of
minimal cut set
in
english language
antecedent
(=>
(
equal
(
MinimalCutSetFn
?GRAPH) ?PATHCLASS)
(
exists
(?NUMBER)
(
forall
(?PATH)
(=>
(
instance
?PATH ?PATHCLASS)
(
pathLength
?PATH ?NUMBER)))))
Merge.kif 62226228
If the
set
of minimal paths that partition
a graph
into two separate graphs is
equal
to
a kind of graph path
,
then there exists
a positive integer
such that for all
another graph path
if
the other graph path
is an
instance
of
a kind of graph path
,
then the
length
of
the other graph path
is
the positive integer
consequent
(=>
(
instance
?GRAPH
Graph
)
(
subclass
(
MinimalCutSetFn
?GRAPH)
(
CutSetFn
?GRAPH)))
Merge.kif 62186220
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 62306237
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 full definition with tree view
Show simplified definition (without tree view)
Show simplified definition (with tree view)
Sigma web home
Suggested Upper Merged Ontology (SUMO) web home
Sigma version 2.99c (>= 2017/11/20) is
open source software
produced by
Articulate Software
and its partners