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。 同一个图可以有多种分割的组合。") chinese_format.kif 2378-2379
(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 6074-6076
(documentation CutSetFn JapaneseLanguage "UnaryFunction は、切り取るとグラフを2つの別々の グラフに分割する GraphPathClassGraph を割り当てる。特定のグラフに複数のカットセット がある場合がある。") japanese_format.kif 1056-1058
(domain CutSetFn 1 Graph) Merge.kif 6071-6071 Die Zahl 1 Argument von CutSetFn ist ein fall von Graph %n{nicht}
(instance CutSetFn UnaryFunction) Merge.kif 6070-6070 CutSetFn ist ein fall von UnaryFunction %n{nicht}
(rangeSubclass CutSetFn GraphPath) Merge.kif 6072-6072 Die werte die CutSetFn zurueckgibt sind teilkategorien von GraphPath

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 777-777
(format FrenchLanguage CutSetFn "l' ensemble de chemins qui partitionnent %1 en deux graph s�par�") french_format.kif 468-468
(format ItalianLanguage CutSetFn "l' insieme di cammini che partiziona %1 in due grafi separati") relations-it.txt 63-63
(format JapaneseLanguage CutSetFn "%1 を2つの別々のグラフに分割するパスの set") japanese_format.kif 2172-2172
(format PortugueseLanguage CutSetFn "o conjunto de caminhos que dividem %1 em dois grafos distintos") portuguese_format.kif 420-420
(format de CutSetFn "die menge von Pfaden die %1 in zwei verschiedene Graphen schnitten") relations-de.txt 1006-1006
(format hi CutSetFn "vaha pathasamuuha jo %1 ko vibhaajita karake do alaga-alaga graapha banaataa hai") relations-hindi.txt 104-104
(format ro CutSetFn "set%t{mulþimea} drumurilor care partiþioneazã %1 în douã grafuri separate") relations-ro.kif 490-490
(format sv CutSetFn "mängden av vägar som partitionerar %1 i två separata grafer") relations-sv.txt 538-538
(format tg CutSetFn "ang pulutong sa ang mga pinagdaraanan ng nagbabahagi %1 sa dalawang bukod na talaguhitan") relations-tg.txt 142-142
(format tg CutSetFn "ang spulutong sa ang mga pinagdaraanan ng nagbabahagi %1 sa dalawang bukod na talaguhitan") relations-cb.txt 97-97
(relatedInternalConcept MinimalCutSetFn CutSetFn) Merge.kif 6081-6081 MinimalCutSetFn ist innerlich verwandt mit CutSetFn %n{nicht}
(termFormat ChineseLanguage CutSetFn "分图路径函数") chinese_format.kif 778-778
(termFormat ChineseLanguage CutSetFn "切集") domainEnglishFormat.kif 18222-18222
(termFormat ChineseTraditionalLanguage CutSetFn "切集") domainEnglishFormat.kif 18221-18221
(termFormat EnglishLanguage CutSetFn "cut set") domainEnglishFormat.kif 18220-18220
(termFormat tg CutSetFn "tungkulin pulutong sa ang mga pinagdaraanan ng nagbabahagi") relations-tg.txt 143-143

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


(=>
    (instance ?GRAPH Graph)
    (subclass
        (MinimalCutSetFn ?GRAPH)
        (CutSetFn ?GRAPH)))
Merge.kif 6087-6089

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 6099-6106 Es gibt nicht GraphPath und ** GraphPath um ** GraphPath ist ein fall von die menge von Pfaden die Graph in zwei verschiedene Graphen schnitten %n{nicht} und ** ** GraphPath ist ein fall von die menge von minimalen Pfaden die ** Graph in zwei verschiedene Graphen schnitten %n{nicht} und die laenge von ** GraphPath ist PositiveInteger %n{nicht} und die laenge von ** ** GraphPath ist ** PositiveInteger %n{nicht} und ** PositiveInteger ist kleinerAls ** ** PositiveInteger %n{nicht}


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 3.0 is open source software produced by Articulate Software and its partners