| Graph(图)
| |
| appearance as argument number 1 |
|
|
| (documentation Graph ChineseLanguage "这是图的 Class，我们可以把图理解成一组由 GraphArc 联系 的 GraphNode。注：这个 Class 只包括连通图，即是两个 GraphNode 之间有一个 GraphPath 的图， 也要注意的是每一个 Graph 需要拥有起码两个 GraphArc 和三个 GraphNode。") | chinese_format.kif 2323-2325 | |
| (documentation Graph EnglishLanguage "The Class of graphs, where a graph is understood to be a set of GraphNodes connected by GraphArcs. Note that this Class includes only connected graphs, i.e. graphs in which there is a GraphPath between any two GraphNodes. Note too that every Graph is required to contain at least two GraphArcs and three GraphNodes.") | Merge.kif 5524-5528 | |
| (externalImage Graph "http://upload.wikimedia.org/wikipedia/commons/thumb/ 3/ 33/ Cubicpoly.svg/ 255px-Cubicpoly.svg.png") | pictureList.kif 1125-1125 | |
| (subclass Graph Proposition) | Merge.kif 5522-5522 | 图 是 命题 的 subclass |
| appearance as argument number 2 |
|
|
| (subclass DirectedGraph Graph) | Merge.kif 5568-5568 | 有向图 是 图 的 subclass |
| (subclass MultiGraph Graph) | Merge.kif 5669-5669 | 多重图 是 图 的 subclass |
| (subclass PseudoGraph Graph) | Merge.kif 5699-5699 | 伪图 是 图 的 subclass |
| (termFormat ChineseLanguage Graph "图") | chinese_format.kif 933-933 | |
| (termFormat EnglishLanguage Graph "graph") | english_format.kif 1073-1073 |
| appearance as argument number 3 |
|
|
| (domain CutSetFn 1 Graph) | Merge.kif 5975-5975 | 分图路径函数 的 1 数量 是 图 的 instance |
| (domain MinimalCutSetFn 1 Graph) | Merge.kif 5983-5983 | 分最短图路径函数 的 1 数量 是 图 的 instance |
| (domain graphMeasure 1 Graph) | Merge.kif 6053-6053 | graphMeasure 的 1 数量 是 图 的 instance |
| (domain graphPart 2 Graph) | Merge.kif 5787-5787 | 图形部分 的 2 数量 是 图 的 instance |
| (domain subGraph 1 Graph) | Merge.kif 5796-5796 | 子图 的 1 数量 是 图 的 instance |
| (domain subGraph 2 Graph) | Merge.kif 5797-5797 | 子图 的 2 数量 是 图 的 instance |
| antecedent |
|
|
| (=> (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 5530-5550 |
|
| (=> (instance ?GRAPH Graph) (exists (?NODE1 ?NODE2 ?NODE3 ?ARC1 ?ARC2) (and (graphPart ?NODE1 ?GRAPH) (graphPart ?NODE2 ?GRAPH) (graphPart ?NODE3 ?GRAPH) (graphPart ?ARC1 ?GRAPH) (graphPart ?ARC2 ?GRAPH) (links ?NODE1 ?NODE2 ?ARC1) (links ?NODE2 ?NODE3 ?ARC2) (not (equal ?NODE1 ?NODE2)) (not (equal ?NODE2 ?NODE3)) (not (equal ?NODE1 ?NODE3)) (not (equal ?ARC1 ?ARC2))))) |
Merge.kif 5552-5566 |
|
| (=> (instance ?GRAPH Graph) (subclass (MinimalCutSetFn ?GRAPH) (CutSetFn ?GRAPH))) |
Merge.kif 5991-5993 |
| consequent |
|
|
| (=> (instance ?PART GraphElement) (exists (?GRAPH) (and (instance ?GRAPH Graph) (graphPart ?PART ?GRAPH)))) |
Merge.kif 5723-5728 | |
| (=> (instance ?TS TransitSystem) (exists (?G) (and (instance ?G Graph) (abstractCounterpart ?G ?TS)))) |
Transportation.kif 2846-2851 |
|
|
|