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。") Merge.kif 6202-6203
(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 6199-6201
(domain MinimalCutSetFn 1 Graph) Merge.kif 6196-6196
(instance MinimalCutSetFn UnaryFunction) Merge.kif 6195-6195
(rangeSubclass MinimalCutSetFn GraphPath) Merge.kif 6197-6197
(relatedInternalConcept MinimalCutSetFn CutSetFn) Merge.kif 6198-6198

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
(format FrenchLanguage MinimalCutSetFn "l' ensemble minimal de chemins qui partitionnent %1 en deux graph s�par�") french_format.kif 469-469
(format ItalianLanguage MinimalCutSetFn "l' insieme di cammini minimi che partiziona %1in due separati grafi") relations-it.txt 189-189
(format PortugueseLanguage MinimalCutSetFn "o conjunto minimal de caminhos que dividem %1 em dois grafos distintos") portuguese_format.kif 421-421
(format de MinimalCutSetFn "die menge von minimalen Pfaden die %1 in zwei verschiedene Graphen schnitten") relations-de.txt 1009-1009
(format hi MinimalCutSetFn "vaha nimnatama pathasamuuha jo %1 ko do alaga-alaga graaphon men vibhaajita karataa hai") relations-hindi.txt 227-227
(termFormat ChineseLanguage MinimalCutSetFn "分最短图路径函数") chinese_format.kif 780-780
(termFormat EnglishLanguage MinimalCutSetFn "minimal cut set") domainEnglishFormat.kif 6731-6731

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


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

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


(=>
    (instance ?GRAPH Graph)
    (subclass
        (MinimalCutSetFn ?GRAPH)
        (CutSetFn ?GRAPH)))
Merge.kif 6205-6207

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 6217-6224


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