Browsing Interface : Welcome guest : log in
Home |  Graph |  ]  KB:  Language:   

Formal Language: 



KB Term:  Term intersection
English Word: 

  MinimalCutSetFn

Sigma KEE - MinimalCutSetFn
MinimalCutSetFn

appearance as argument number 1
-------------------------


(documentation MinimalCutSetFn ChineseLanguage "这是一个 UnaryFunction,它以最少条 GraphArc 把一个 Graph 划分的分割组合,给这个 Graph 分配 GraphPath Class。") Merge.kif 6215-6216
(documentation MinimalCutSetFn EnglishLanguage "A UnaryFunction that assigns a Graph the Class of GraphPaths which comprise cutsets for the Graph and which have the least number of GraphArcs.") Merge.kif 6212-6214
(domain MinimalCutSetFn 1 Graph) Merge.kif 6209-6209 分最短图路径函数 的 1 数量 是 instance
(instance MinimalCutSetFn UnaryFunction) Merge.kif 6208-6208 分最短图路径函数一元函数instance
(rangeSubclass MinimalCutSetFn GraphPath) Merge.kif 6210-6210 分最短图路径函数 的所得值 是 图路径subclass
(relatedInternalConcept MinimalCutSetFn CutSetFn) Merge.kif 6211-6211 分最短图路径函数分图路径函数 是 内部相关

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 480-480
(termFormat ChineseLanguage MinimalCutSetFn "分最短图路径函数") chinese_format.kif 780-780 termFormat ChineseLanguage, 分最短图路径函数 and "分最短图路径函数"
(termFormat EnglishLanguage MinimalCutSetFn "minimal cut set") domainEnglishFormat.kif 6731-6731 termFormat EnglishLanguage, 分最短图路径函数 and "minimal cut set"

antecedent
-------------------------


(=>
    (equal
        (MinimalCutSetFn ?GRAPH) ?PATHCLASS)
    (exists (?NUMBER)
        (forall (?PATH)
            (=>
                (instance ?PATH ?PATHCLASS)
                (pathLength ?PATH ?NUMBER)))))
Merge.kif 6222-6228

consequent
-------------------------


(=>
    (instance ?GRAPH Graph)
    (subclass
        (MinimalCutSetFn ?GRAPH)
        (CutSetFn ?GRAPH)))
Merge.kif 6218-6220

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 6230-6237 不存在 图路径另一个 图路径 这样 那个 图路径 是 把 分成另外两个图的路径 Setinstance那个 另外 图路径 是 把 那个 图 分成另外两个图的最短路径 Setinstance那个 图路径length 正整数那个 另外 图路径length另一个 正整数那个 正整数lessThan 那个 另外 正整数


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 2.99c (>= 2017/11/20) is open source software produced by Articulate Software and its partners