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

Formal Language: 



KB Term:  Term intersection
English Word: 

Sigma KEE - CutSetFn
CutSetFn

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


(documentation CutSetFn ChineseLanguage "这是一个 UnaryFunction,在要切开一个 Graph 的时候, 它会给这个图分配把它划分为两的 GraphPath Class。 同一个图可以有多种分割的组合。") Merge.kif 6205-6206
(documentation CutSetFn EnglishLanguage "A UnaryFunction that assigns a Graph the Class of GraphPaths that partition the graph into two separate graphs if cut. There may be more than one cutset for a given graph.") Merge.kif 6202-6204
(domain CutSetFn 1 Graph) Merge.kif 6200-6200 The number 1 argument of cut set is an instance of graph
(instance CutSetFn UnaryFunction) Merge.kif 6199-6199 Cut set is an instance of unary function
(rangeSubclass CutSetFn GraphPath) Merge.kif 6201-6201 The values returned by cut set are subclasses of graph path

appearance as argument number 2
-------------------------


(format ChineseLanguage CutSetFn "把 %1 分成另外两个图的路径 Set") chinese_format.kif 777-777
(format EnglishLanguage CutSetFn "the set of paths that partition %1 into two separate graphs") english_format.kif 479-479
(relatedInternalConcept MinimalCutSetFn CutSetFn) Merge.kif 6211-6211 Minimal cut set is internally related to cut set
(termFormat ChineseLanguage CutSetFn "分图路径函数") chinese_format.kif 778-778 "分图路径函数" is the printable form of cut set in ChineseLanguage
(termFormat EnglishLanguage CutSetFn "cut set") domainEnglishFormat.kif 3458-3458 "cut set" is the printable form of cut set in english language

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