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

Formal Language: 



KB Term:  Term intersection
English Word: 

  MinimalCutSetFn

Sigma KEE - MinimalCutSetFn
MinimalCutSetFn

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


No TPTP formula. May not be expressible in strict first order. chinese_format.kif 2380-2381
No TPTP formula. May not be expressible in strict first order. Merge.kif 5779-5781
No TPTP formula. May not be expressible in strict first order. Merge.kif 5775-5775 The number 1 argument of minimal cut set is an instance of graph
No TPTP formula. May not be expressible in strict first order. Merge.kif 5774-5774 Minimal cut set is an instance of unary function
No TPTP formula. May not be expressible in strict first order. Merge.kif 5776-5776 The values returned by minimal cut set are subclasses of graph path
No TPTP formula. May not be expressible in strict first order. Merge.kif 5777-5777 Minimal cut set is internally related to cut set

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


No TPTP formula. May not be expressible in strict first order. chinese_format.kif 779-779
No TPTP formula. May not be expressible in strict first order. english_format.kif 782-782
No TPTP formula. May not be expressible in strict first order. chinese_format.kif 780-780
No TPTP formula. May not be expressible in strict first order. domainEnglishFormat.kif 37795-37795
No TPTP formula. May not be expressible in strict first order. domainEnglishFormat.kif 37794-37794
No TPTP formula. May not be expressible in strict first order. domainEnglishFormat.kif 37793-37793

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


No TPTP formula. May not be expressible in strict first order. Merge.kif 5787-5793

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


No TPTP formula. May not be expressible in strict first order. Merge.kif 5783-5785

statement
-------------------------


No TPTP formula. May not be expressible in strict first order. Merge.kif 5795-5802 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 simplified definition (without tree view)
Show simplified definition (with tree view)

Show without tree


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