| GraphPath | |
| appearance as argument number 1 |
|
|
| (documentation GraphPath ChineseLanguage "非形式来说，这是一个 Graph 的两个 GraphNode 之间 的单一有向的路径。形式的说，这是一个 DirectedGraph，它是原来的 Graph 的 subGraph，而使得 这个 DirectedGraph 里没有两个 GraphArc 有着相同的始点(可参考 InitialNodeFn) 或相同的终点 (可参考 TerminalNodeFn)。") | chinese_format.kif 2330-2333 | |
| (documentation GraphPath EnglishLanguage "Informally, a single, directed route between two GraphNodes in a Graph. Formally, a DirectedGraph that is a subGraph of the original Graph and such that no two GraphArcs in the DirectedGraph have the same initial node (see InitialNodeFn) or the same terminal node (see TerminalNodeFn).") | Merge.kif 5687-5691 | |
| (subclass GraphPath DirectedGraph) | Merge.kif 5685-5685 |
| appearance as argument number 2 |
|
|
| (range MaximalWeightedPathFn GraphPath) | Merge.kif 6001-6001 | |
| (range MinimalWeightedPathFn GraphPath) | Merge.kif 5979-5979 | |
| (rangeSubclass CutSetFn GraphPath) | Merge.kif 6039-6039 | |
| (rangeSubclass GraphPathFn GraphPath) | Merge.kif 6023-6023 | |
| (rangeSubclass MinimalCutSetFn GraphPath) | Merge.kif 6047-6047 | |
| (subclass GraphCircuit GraphPath) | Merge.kif 5719-5719 | |
| (termFormat ChineseLanguage GraphPath "图路径") | chinese_format.kif 936-936 | |
| (termFormat EnglishLanguage GraphPath "graph path") | english_format.kif 1079-1079 |
| appearance as argument number 3 |
|
|
| (domain BeginNodeFn 1 GraphPath) | Merge.kif 5909-5909 | |
| (domain EndNodeFn 1 GraphPath) | Merge.kif 5920-5920 | |
| (domain PathWeightFn 1 GraphPath) | Merge.kif 5939-5939 | |
| (domain pathLength 1 GraphPath) | Merge.kif 5879-5879 |
| antecedent |
|
|
| (=> (and (instance ?GRAPH GraphPath) (instance ?ARC GraphArc) (graphPart ?ARC ?GRAPH) (equal (InitialNodeFn ?ARC) ?NODE)) (not (exists (?OTHER) (and (equal (InitialNodeFn ?OTHER) ?NODE) (not (equal ?OTHER ?ARC)))))) |
Merge.kif 5693-5704 | |
| (=> (and (instance ?GRAPH GraphPath) (instance ?ARC GraphArc) (graphPart ?ARC ?GRAPH) (equal (TerminalNodeFn ?ARC) ?NODE)) (not (exists (?OTHER) (and (equal (TerminalNodeFn ?OTHER) ?NODE) (not (equal ?OTHER ?ARC)))))) |
Merge.kif 5706-5717 |
| consequent |
|
|
| (=> (and (instance ?GRAPH Graph) (instance ?NODE1 GraphNode) (instance ?NODE2 GraphNode) (graphPart ?NODE1 ?GRAPH) (graphPart ?NODE2 ?GRAPH) (not (equal ?NODE1 ?NODE2))) (exists (?ARC ?PATH) (or (links ?NODE1 ?NODE2 ?ARC) (and (subGraph ?PATH ?GRAPH) (instance ?PATH GraphPath) (or (and (equal (BeginNodeFn ?PATH) ?NODE1) (equal (EndNodeFn ?PATH) ?NODE2)) (and (equal (BeginNodeFn ?PATH) ?NODE2) (equal (EndNodeFn ?PATH) ?NODE1))))))) |
Merge.kif 5597-5617 | |
| (=> (distanceOnPath ?DIST ?PATH) (exists (?GP) (and (instance ?GP GraphPath) (abstractCounterpart ?GP ?PATH)))) |
Transportation.kif 2799-2804 |
|
|
|