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 6083-6085 | |
No TPTP formula. May not be expressible in strict first order. | japanese_format.kif 1059-1060 | |
No TPTP formula. May not be expressible in strict first order. | Merge.kif 6079-6079 | Le nombre 1 argument de MinimalCutSetFn est une instance de graph |
No TPTP formula. May not be expressible in strict first order. | Merge.kif 6078-6078 | MinimalCutSetFn est une instance de function unaire |
No TPTP formula. May not be expressible in strict first order. | Merge.kif 6080-6080 | Les valeurs retourn�es par MinimalCutSetFn sont des sous-classes de chemin du graph |
No TPTP formula. May not be expressible in strict first order. | Merge.kif 6081-6081 | MinimalCutSetFn est reli� � l'int�rieur de SUMO � CutSetFn |
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. | french_format.kif 469-469 | |
No TPTP formula. May not be expressible in strict first order. | relations-it.txt 189-189 | |
No TPTP formula. May not be expressible in strict first order. | japanese_format.kif 2173-2173 | |
No TPTP formula. May not be expressible in strict first order. | portuguese_format.kif 421-421 | |
No TPTP formula. May not be expressible in strict first order. | relations-de.txt 1009-1009 | |
No TPTP formula. May not be expressible in strict first order. | relations-hindi.txt 227-227 | |
No TPTP formula. May not be expressible in strict first order. | relations-ro.kif 491-491 | |
No TPTP formula. May not be expressible in strict first order. | relations-sv.txt 539-539 | |
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 37865-37865 | |
No TPTP formula. May not be expressible in strict first order. | domainEnglishFormat.kif 37864-37864 | |
No TPTP formula. May not be expressible in strict first order. | domainEnglishFormat.kif 37863-37863 |
antecedent |
No TPTP formula. May not be expressible in strict first order. | Merge.kif 6091-6097 |
|
consequent |
No TPTP formula. May not be expressible in strict first order. | Merge.kif 6087-6089 |
statement |
No TPTP formula. May not be expressible in strict first order. | Merge.kif 6099-6106 | Chemin du graph chemin du graph chemin du graph est une instance de l' ensemble de chemins qui partitionnent graph en deux graph s�par� chemin du graph est une instance de l' ensemble minimal de chemins qui partitionnent graph en deux graph s�par� la longueur de chemin du graph est nombre entier positif la longueur de chemin du graph est nombre entier positif nombre entier positif est moins que nombre entier positif |