Browsing Interface : Welcome guest : log in
|
Browsing Interface : Welcome guest : log in |
[
Home |
Graph |
LogLearn |
Editor |
]
KB:
Language:
Formal Language:
|
| MaximalWeightedPathFn |
| appearance as argument number 1 |
|
| (instance MaximalWeightedPathFn BinaryFunction) | Merge.kif 6149-6149 | Maximal weighted path is an instance of binary function |
| (instance MaximalWeightedPathFn TotalValuedRelation) | Merge.kif 6150-6150 | Maximal weighted path is an instance of total valued relation |
| (domain MaximalWeightedPathFn 1 GraphNode) | Merge.kif 6151-6151 | The number 1 argument of maximal weighted path is an instance of graph node |
| (domain MaximalWeightedPathFn 2 GraphNode) | Merge.kif 6152-6152 | The number 2 argument of maximal weighted path is an instance of graph node |
| (range MaximalWeightedPathFn GraphPath) | Merge.kif 6153-6153 | The range of maximal weighted path is an instance of graph path |
| (documentation MaximalWeightedPathFn EnglishLanguage "This BinaryFunction assigns two GraphNodes to the GraphPath with the largest sum of weighted arcs between the two GraphNodes.") | Merge.kif 6155-6157 | The range of maximal weighted path is an instance of graph path |
| appearance as argument number 2 |
|
|
| (termFormat EnglishLanguage MaximalWeightedPathFn "maximal weighted path") | domainEnglishFormat.kif 36593-36593 | |
| (termFormat ChineseTraditionalLanguage MaximalWeightedPathFn "最大加權路徑") | domainEnglishFormat.kif 36594-36594 | |
| (termFormat ChineseLanguage MaximalWeightedPathFn "最大加权路径") | domainEnglishFormat.kif 36595-36595 | |
| (format EnglishLanguage MaximalWeightedPathFn "the highest cost path between %1 and %2") | english_format.kif 773-773 |
| antecedent |
|
|
| (=> (equal (MaximalWeightedPathFn ?NODE1 ?NODE2) ?PATH) (instance ?PATH (GraphPathFn ?NODE1 ?NODE2))) |
Merge.kif 6159-6161 | If equal the highest cost path between X, Y, and Z, then Z is an instance of the set of paths between X and Y |
| (=> (and (equal (MaximalWeightedPathFn ?NODE1 ?NODE2) ?PATH) (equal (PathWeightFn ?PATH) ?NUMBER1) (instance ?PATH2 (GraphPathFn ?NODE1 ?NODE2)) (equal (PathWeightFn ?PATH2) ?NUMBER2)) (lessThanOrEqualTo ?NUMBER2 ?NUMBER1)) |
Merge.kif 6163-6169 | If equal the highest cost path between X, Y, and Z, equal the value of Z and W, V is an instance of the set of paths between X and Y, and equal the value of V and U, then U is less than or equal to W |
|