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。") chinese_format.kif 2380-2381
(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 5826-5828
(domain MinimalCutSetFn 1 Graph) Merge.kif 5822-5822
(instance MinimalCutSetFn UnaryFunction) Merge.kif 5821-5821
(rangeSubclass MinimalCutSetFn GraphPath) Merge.kif 5823-5823
(relatedInternalConcept MinimalCutSetFn CutSetFn) Merge.kif 5824-5824

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
(termFormat ChineseLanguage MinimalCutSetFn "分最短图路径函数") chinese_format.kif 780-780
(termFormat ChineseLanguage MinimalCutSetFn "最小割集") domainEnglishFormat.kif 37854-37854
(termFormat ChineseTraditionalLanguage MinimalCutSetFn "最小割集") domainEnglishFormat.kif 37853-37853
(termFormat EnglishLanguage MinimalCutSetFn "minimal cut set") domainEnglishFormat.kif 37852-37852

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


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

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


(=>
    (instance ?GRAPH Graph)
    (subclass
        (MinimalCutSetFn ?GRAPH)
        (CutSetFn ?GRAPH)))
Merge.kif 5830-5832

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 5842-5849


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