lessThan |
appearance as argument number 1 |
![]() |
appearance as argument number 2 |
![]() |
(format ChineseLanguage lessThan "%1 %n 是 lessThan %2") | chinese_format.kif 141-141 | |
(format EnglishLanguage lessThan "%1 is %n less than %2") | english_format.kif 142-142 | |
(inverse greaterThan lessThan) | Merge.kif 1827-1827 | greater than is an inverse of less than |
(termFormat ChineseLanguage lessThan "少于") | chinese_format.kif 142-142 | |
(termFormat ChineseTraditionalLanguage lessThan "少於") | domainEnglishFormat.kif 34122-34122 | |
(termFormat EnglishLanguage lessThan "less than") | domainEnglishFormat.kif 34121-34121 |
antecedent |
![]() |
consequent |
![]() |
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 6066-6073 | 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 |
![]() |
![]() |