Browsing Interface : Welcome guest : log in
|
Browsing Interface : Welcome guest : log in |
[
Home |
Graph |
LogLearn |
Editor |
]
KB:
Language:
Formal Language:
|
| MinimalWeightedPathFn |
| appearance as argument number 1 |
|
| (instance MinimalWeightedPathFn BinaryFunction) | Merge.kif 6127-6127 | Minimal weighted path is an instance of binary function |
| (instance MinimalWeightedPathFn TotalValuedRelation) | Merge.kif 6128-6128 | Minimal weighted path is an instance of total valued relation |
| (domain MinimalWeightedPathFn 1 GraphNode) | Merge.kif 6129-6129 | The number 1 argument of minimal weighted path is an instance of graph node |
| (domain MinimalWeightedPathFn 2 GraphNode) | Merge.kif 6130-6130 | The number 2 argument of minimal weighted path is an instance of graph node |
| (range MinimalWeightedPathFn GraphPath) | Merge.kif 6131-6131 | The range of minimal weighted path is an instance of graph path |
| (documentation MinimalWeightedPathFn EnglishLanguage "This BinaryFunction assigns two GraphNodes to the GraphPath with the smallest sum of weighted arcs between the two GraphNodes.") | Merge.kif 6133-6135 | The range of minimal weighted path is an instance of graph path |
| appearance as argument number 2 |
|
|
| (termFormat EnglishLanguage MinimalWeightedPathFn "minimal weighted path") | domainEnglishFormat.kif 37871-37871 | |
| (termFormat ChineseTraditionalLanguage MinimalWeightedPathFn "最小加權路徑") | domainEnglishFormat.kif 37872-37872 | |
| (termFormat ChineseLanguage MinimalWeightedPathFn "最小加权路径") | domainEnglishFormat.kif 37873-37873 | |
| (format EnglishLanguage MinimalWeightedPathFn "the lowest cost path between %1 and %2") | english_format.kif 771-771 |
| antecedent |
|
|
| (=> (equal (MinimalWeightedPathFn ?NODE1 ?NODE2) ?PATH) (instance ?PATH (GraphPathFn ?NODE1 ?NODE2))) |
Merge.kif 6137-6139 | If equal the lowest cost path between X, Y, and Z, then Z is an instance of the set of paths between X and Y |
| (=> (and (equal (MinimalWeightedPathFn ?NODE1 ?NODE2) ?PATH) (equal (PathWeightFn ?PATH) ?NUMBER1) (instance ?PATH2 (GraphPathFn ?NODE1 ?NODE2)) (equal (PathWeightFn ?PATH2) ?NUMBER2)) (greaterThanOrEqualTo ?NUMBER2 ?NUMBER1)) |
Merge.kif 6141-6147 | If equal the lowest 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 greater than or equal to W |
|