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 | |
(format FrenchLanguage lessThan "%1 est %n moins que %2") | french_format.kif 92-92 | |
(format ItalianLanguage lessThan "%1 è %n meno di%2") | relations-it.txt 163-163 | |
(format JapaneseLanguage lessThan "%1 は %2 より less では %n") | japanese_format.kif 1919-1919 | |
(format PortugueseLanguage lessThan "%1 e' %n menos que %2") | portuguese_format.kif 44-44 | |
(format cz lessThan "%1 %p{je} %n{nen�} men�� ne� %2") | relations-cz.txt 76-76 | |
(format de lessThan "%1 ist kleinerAls %2 %n{nicht}") | relations-de.txt 172-172 | |
(format hi lessThan "%1 %2 se kama %n hai") | relations-hindi.txt 202-202 | |
(format ro lessThan "%1 %n{nu} este less%t{mai mic} decât %2") | relations-ro.kif 111-111 | |
(format sv lessThan "%1 är %n{inte} mindre än %2") | relations-sv.txt 91-91 | |
(format tg lessThan "%1 %n ay meno ng %2") | relations-tg.txt 325-325 | |
(inverse greaterThan lessThan) | Merge.kif 1850-1850 | greaterThan est l' inverse de lessThan |
(termFormat ChineseLanguage lessThan "少于") | chinese_format.kif 142-142 | |
(termFormat ChineseTraditionalLanguage lessThan "少於") | domainEnglishFormat.kif 34144-34144 | |
(termFormat EnglishLanguage lessThan "less than") | domainEnglishFormat.kif 34143-34143 | |
(termFormat de lessThan "kleinerAls") | terms-de.txt 52-52 | |
(termFormat tg lessThan "meno ng") | relations-tg.txt 326-326 |
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 6100-6107 | 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 |