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


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 5987-5989
No TPTP formula. May not be expressible in strict first order. Merge.kif 5983-5983 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 5982-5982 Minimal cut set is an instance of unary function
No TPTP formula. May not be expressible in strict first order. Merge.kif 5984-5984 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 5985-5985 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 779-779
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 37854-37854
No TPTP formula. May not be expressible in strict first order. domainEnglishFormat.kif 37853-37853
No TPTP formula. May not be expressible in strict first order. domainEnglishFormat.kif 37852-37852

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


No TPTP formula. May not be expressible in strict first order. Merge.kif 5995-6001

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


No TPTP formula. May not be expressible in strict first order. Merge.kif 5991-5993

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


No TPTP formula. May not be expressible in strict first order. Merge.kif 6003-6010 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 3.0 is open source software produced by Articulate Software and its partners