Browsing Interface : Welcome guest : log in
|
Browsing Interface : Welcome guest : log in |
[
Home |
Graph |
LogLearn |
Editor |
]
KB:
Language:
Formal Language:
|
| pathLength |
| appearance as argument number 1 |
|
| (instance pathLength BinaryPredicate) | Merge.kif 6030-6030 | path length is an instance of binary predicate |
| (domain pathLength 1 GraphPath) | Merge.kif 6031-6031 | The number 1 argument of path length is an instance of graph path |
| (domain pathLength 2 PositiveInteger) | Merge.kif 6032-6032 | The number 2 argument of path length is an instance of positive integer |
| (documentation pathLength EnglishLanguage "A BinaryPredicate that specifies the length (in number of GraphNodes) of a GraphPath. (pathLength ?PATH ?NUMBER) means that there are ?NUMBER nodes in the GraphPath ?PATH.") | Merge.kif 6034-6037 | The number 2 argument of path length is an instance of positive integer |
| appearance as argument number 2 |
|
|
| (termFormat EnglishLanguage pathLength "path length") | domainEnglishFormat.kif 44777-44777 | |
| (termFormat ChineseTraditionalLanguage pathLength "路徑長度") | domainEnglishFormat.kif 44778-44778 | |
| (termFormat ChineseLanguage pathLength "路径长度") | domainEnglishFormat.kif 44779-44779 | |
| (format EnglishLanguage pathLength "the length of %1 is %n %2") | english_format.kif 755-755 |
| consequent |
|
|
| (=> (equal (MinimalCutSetFn ?GRAPH) ?PATHCLASS) (exists (?NUMBER) (forall (?PATH) (=> (instance ?PATH ?PATHCLASS) (pathLength ?PATH ?NUMBER))))) |
Merge.kif 6210-6216 | If equal the set of minimal paths that partition X into two separate graphs and Y, then there exists Z such that W W is an instance of Ythe length of W is Z |
| 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 6218-6225 | There don't exist X, Y such that X is an instance of the set of paths that partition Z into two separate graphs, Y is an instance of the set of minimal paths that partition Z into two separate graphs, the length of X is W, the length of Y is V, and W is less than V |
|