Browsing Interface : Welcome guest : log in
Home |  Graph |  ]  KB:  Language:   

Formal Language: 



KB Term:  Term intersection
English Word: 

Sigma KEE - Graph
Graph(graph)
Cartesian_coordinate_system, bus, bus_topology, coordinate_system, exponential_curve, frame_of_reference, graph, inertial_frame, inertial_reference_frame, logical_topology, loop, loop_topology, mesh, mesh_topology, physical_topology, profile, reference_frame, reference_system, star, star_topology, グラフ,

appearance as argument number 1
-------------------------


(documentation Graph ChineseLanguage "这是图的 Class,我们可以把图理解成一组由 GraphArc 联系 的 GraphNode。注:这个 Class 只包括连通图,即是两个 GraphNode 之间有一个 GraphPath 的图, 也要注意的是每一个 Graph 需要拥有起码两个 GraphArc 和三个 GraphNode。") Merge.kif 5748-5750
(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 5743-5747
(externalImage Graph "http://upload.wikimedia.org/wikipedia/commons/thumb/ 3/ 33/ Cubicpoly.svg/ 255px-Cubicpoly.svg.png") pictureList.kif 1125-1125 "http://upload.wikimedia.org/wikipedia/commons/thumb/ 3/ 33/ Cubicpoly.svg/ 255px-Cubicpoly.svg.png" is a URL depicting graph
(subclass Graph Proposition) Merge.kif 5742-5742 Graph is a subclass of proposition

appearance as argument number 2
-------------------------


(subclass DirectedGraph Graph) Merge.kif 5790-5790 Directed graph is a subclass of graph
(subclass MultiGraph Graph) Merge.kif 5891-5891 Multi graph is a subclass of graph
(subclass PseudoGraph Graph) Merge.kif 5910-5910 Pseudo graph is a subclass of graph
(termFormat ChineseLanguage Graph "图") chinese_format.kif 933-933 "图" is the printable form of graph in ChineseLanguage
(termFormat EnglishLanguage Graph "graph") english_format.kif 865-865 "graph" is the printable form of graph in english language
(termFormat JapaneseLanguage Graph "グラフ") english_format.kif 866-866 "グラフ" is the printable form of graph in japanese language

appearance as argument number 3
-------------------------


(domain CutSetFn 1 Graph) Merge.kif 6200-6200 The number 1 argument of cut set is an instance of graph
(domain MinimalCutSetFn 1 Graph) Merge.kif 6209-6209 The number 1 argument of minimal cut set is an instance of graph
(domain graphMeasure 1 Graph) Merge.kif 6287-6287 The number 1 argument of graphMeasure is an instance of graph
(domain graphPart 2 Graph) Merge.kif 5993-5993 The number 2 argument of graph part is an instance of graph
(domain subGraph 1 Graph) Merge.kif 6003-6003 The number 1 argument of sub graph is an instance of graph
(domain subGraph 2 Graph) Merge.kif 6004-6004 The number 2 argument of sub graph is an instance of graph

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 5752-5772
(=>
    (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 5774-5788
(=>
    (instance ?GRAPH Graph)
    (subclass
        (MinimalCutSetFn ?GRAPH)
        (CutSetFn ?GRAPH)))
Merge.kif 6218-6220

consequent
-------------------------


(=>
    (instance ?PART GraphElement)
    (exists (?GRAPH)
        (and
            (instance ?GRAPH Graph)
            (graphPart ?PART ?GRAPH))))
Merge.kif 5930-5935
(=>
    (instance ?TS TransitSystem)
    (exists (?G)
        (and
            (instance ?G Graph)
            (abstractCounterpart ?G ?TS))))
Transportation.kif 2783-2788


Show full definition with tree view
Show simplified definition (without tree view)
Show simplified definition (with tree view)



Sigma web home      Suggested Upper Merged Ontology (SUMO) web home
Sigma version 2.99c (>= 2017/11/20) is open source software produced by Articulate Software and its partners