TreeView Knowledge Base Browser

appearance as argument number 1

(instance CutSetFn UnaryFunction)	Merge.kif 6189-6189	Cut set is an instance of unary function
(domain CutSetFn 1 Graph)	Merge.kif 6190-6190	The number 1 argument of cut set is an instance of graph
(rangeSubclass CutSetFn GraphPath)	Merge.kif 6191-6191	The values returned by cut set are subclasses of graph path
(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 6193-6195	The values returned by cut set are subclasses of graph path

appearance as argument number 2

(relatedInternalConcept MinimalCutSetFn CutSetFn)	Merge.kif 6200-6200	Minimal cut set is internally related to cut set
(termFormat EnglishLanguage CutSetFn "cut set")	domainEnglishFormat.kif 18222-18222	Minimal cut set is internally related to cut set
(termFormat ChineseTraditionalLanguage CutSetFn "切集")	domainEnglishFormat.kif 18223-18223	Minimal cut set is internally related to cut set
(termFormat ChineseLanguage CutSetFn "切集")	domainEnglishFormat.kif 18224-18224	Minimal cut set is internally related to cut set
(format EnglishLanguage CutSetFn "the set of paths that partition %1 into two separate graphs")	english_format.kif 777-777	Minimal cut set is internally related to cut set

consequent

(=>
    (instance ?GRAPH Graph)
    (subclass
        (MinimalCutSetFn ?GRAPH)
        (CutSetFn ?GRAPH)))

Merge.kif 6206-6208

If X is an instance of graph, then the set of minimal paths that partition X into two separate graphs is a subclass of the set of paths that partition X into two separate graphs

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

There don't exist X, Y such that X is an instance of the set of paths that partition Z into two separate graphs, Y is an instance of the set of minimal paths that partition Z into two separate graphs, the length of X is W, the length of Y is V, and W is less than V

Show simplified definition (without tree view)
Show simplified definition (with tree view)

KB Term:			Term intersection

English Word: