Browsing Interface : Welcome guest : log in
|
Browsing Interface : Welcome guest : log in |
[
Home |
Graph |
LogLearn |
Editor |
]
KB:
Language:
Formal Language:
|
| routeEnd |
| appearance as argument number 1 |
|
| (instance routeEnd BinaryPredicate) | Transportation.kif 3917-3917 | route end is an instance of binary predicate |
| (domain routeEnd 1 Region) | Transportation.kif 3918-3918 | The number 1 argument of route end is an instance of region |
| (domain routeEnd 2 TransitSystem) | Transportation.kif 3919-3919 | The number 2 argument of route end is an instance of transit system |
| (documentation routeEnd EnglishLanguage "(routeEnd ?REGION ?SYSTEM) means that within the given ?SYSTEM the given ?REGION is connected to only one other Region.") | Transportation.kif 3920-3922 | The number 2 argument of route end is an instance of transit system |
| appearance as argument number 2 |
|
|
| (format EnglishLanguage routeEnd "%1 is the end of %2") | domainEnglishFormat.kif 4456-4456 | |
| (format ChineseTraditionalLanguage routeEnd "%1 是 %2 的 end ") | domainEnglishFormat.kif 4457-4457 | |
| (format ChineseLanguage routeEnd "%1 是 %2 的 end ") | domainEnglishFormat.kif 4458-4458 | |
| (termFormat EnglishLanguage routeEnd "route end") | domainEnglishFormat.kif 65963-65963 |
| antecedent |
|
|
| (=> (routeEnd ?R ?TS) (exists (?T) (and (instance ?T Transitway) (connected ?R ?T) (systemPart ?T ?TS) (not (exists (?T2) (and (instance ?T2 Transitway) (connected ?R ?T2) (systemPart ?T2 ?TS) (not (equal ?T ?T2)))))))) |
Transportation.kif 3924-3938 | If X is the end of Y, then All of the following hold: (1) there exists Z such that Z is an instance of transitway (2) X is connected to Z (3) Y is a system part of Z (4) there doesn't exist W such that W is an instance of transitway (5) X is connected to W (6) Y is a system part of W (7) equal Z (8) W |
| (=> (and (distanceOnPath ?DIST ?PATH) (pathInSystem ?PATH ?SYS) (routeStart ?START ?PATH) (routeEnd ?END ?PATH) (abstractCounterpart ?GRAPH ?SYS)) (exists (?S ?BN ?EN) (and (subGraph ?S ?GRAPH) (equal ?BN (BeginNodeFn ?GRAPH)) (equal ?EN (EndNodeFn ?GRAPH)) (abstractCounterpart ?BN ?START) (abstractCounterpart ?EN ?END)))) |
Transportation.kif 3947-3960 | If the distance of X is Y, Z is a path in system of X, W is the start of X, V is the end of X, and the abstract counterpart of Z is U, then All of the following hold: (1) there exist T, S (2) R such that T is a subgraph of U (3) equal S (4) the beginning of U (5) equal R (6) the end of U (7) the abstract counterpart of W is S (8) the abstract counterpart of V is R |
|