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


No TPTP formula. May not be expressible in strict first order. chinese_format.kif 2378-2379
No TPTP formula. May not be expressible in strict first order. Merge.kif 5978-5980
No TPTP formula. May not be expressible in strict first order. Merge.kif 5975-5975 The number 1 argument of cut set is an instance of graph
No TPTP formula. May not be expressible in strict first order. Merge.kif 5974-5974 Cut set is an instance of unary function
No TPTP formula. May not be expressible in strict first order. Merge.kif 5976-5976 The values returned by cut set are subclasses of graph path

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


No TPTP formula. May not be expressible in strict first order. chinese_format.kif 777-777
No TPTP formula. May not be expressible in strict first order. english_format.kif 777-777
No TPTP formula. May not be expressible in strict first order. Merge.kif 5985-5985 Minimal cut set is internally related to cut set
No TPTP formula. May not be expressible in strict first order. chinese_format.kif 778-778
No TPTP formula. May not be expressible in strict first order. domainEnglishFormat.kif 18213-18213
No TPTP formula. May not be expressible in strict first order. domainEnglishFormat.kif 18212-18212
No TPTP formula. May not be expressible in strict first order. domainEnglishFormat.kif 18211-18211

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