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

Formal Language: 



KB Term:  Term intersection
English Word: 

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 5648-5650
(domain MinimalCutSetFn 1 Graph) Merge.kif 5644-5644 The number 1 argument of minimal cut set is an instance of graph
(instance MinimalCutSetFn UnaryFunction) Merge.kif 5643-5643 Minimal cut set is an instance of unary function
(rangeSubclass MinimalCutSetFn GraphPath) Merge.kif 5645-5645 The values returned by minimal cut set are subclasses of graph path
(relatedInternalConcept MinimalCutSetFn CutSetFn) Merge.kif 5646-5646 Minimal cut set is internally related to cut set

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 782-782
(termFormat ChineseLanguage MinimalCutSetFn "分最短图路径函数") chinese_format.kif 780-780 "分最短图路径函数" is the printable form of minimal cut set in ChineseLanguage
(termFormat ChineseLanguage MinimalCutSetFn "最小割集") domainEnglishFormat.kif 37789-37789 "最小割集" is the printable form of minimal cut set in ChineseLanguage
(termFormat ChineseTraditionalLanguage MinimalCutSetFn "最小割集") domainEnglishFormat.kif 37788-37788 "最小割集" is the printable form of minimal cut set in ChineseTraditionalLanguage
(termFormat EnglishLanguage MinimalCutSetFn "minimal cut set") domainEnglishFormat.kif 37787-37787 "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 5656-5662

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


(=>
    (instance ?GRAPH Graph)
    (subclass
        (MinimalCutSetFn ?GRAPH)
        (CutSetFn ?GRAPH)))
Merge.kif 5652-5654

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 5664-5671 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