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

Formal Language: 


KB Term:  Term intersection
English Word: 

  Graph

 Sigma KEE - Graph
Graph(graph)Cartesian_coordinate_system, bus, bus_topology, coordinate_system, exponential_curve, frame_of_reference, 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。") 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 5649-5653
(documentation Graph JapaneseLanguage "グラフの Clas は、グラフが GraphArcs によって接続 された GraphNode のセットであると理解される。注１：この Class には、接続されたグラフのみが含ま れる。　すなわち、グラフは、任意の2つの間にあるGraphPath内にある。注２：すべての Graph には 少なくとも２つの GraphArcs と ３つの GraphNodes が含まれている必要がある。") japanese_format.kif 996-999
(subclass Graph Proposition) Merge.kif 5647-5647 Graph is a subclass of proposition

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


(subclass DirectedGraph Graph) Merge.kif 5693-5693 Directed graph is a subclass of graph
(subclass MultiGraph Graph) Merge.kif 5796-5796 Multi graph is a subclass of graph
(subclass PseudoGraph Graph) Merge.kif 5826-5826 Pseudo graph is a subclass of graph
(termFormat ChineseLanguage Graph "图") chinese_format.kif 933-933 Pseudo graph is a subclass of graph
(termFormat EnglishLanguage Graph "graph") english_format.kif 1073-1073 Pseudo graph is a subclass of graph
(termFormat FrenchLanguage Graph "graph") french_format.kif 609-609 Pseudo graph is a subclass of graph
(termFormat Hindi Graph "aalekha") terms-hindi.txt 140-140 Pseudo graph is a subclass of graph
(termFormat ItalianLanguage Graph "Grafo") terms-it.txt 143-143 Pseudo graph is a subclass of graph
(termFormat JapaneseLanguage Graph "グラフ") japanese_format.kif 2294-2294 Pseudo graph is a subclass of graph
(termFormat PortugueseLanguage Graph "Grafo") portuguese_format.kif 561-561 Pseudo graph is a subclass of graph
(termFormat cb Graph "agi") terms-cb.txt 145-145 Pseudo graph is a subclass of graph
(termFormat cz Graph "graph") terms-cz.txt 177-177 Pseudo graph is a subclass of graph
(termFormat de Graph "Graph") terms-de.txt 436-436 Pseudo graph is a subclass of graph
(termFormat ro Graph "graf") relations-ro.kif 630-630 Pseudo graph is a subclass of graph
(termFormat tg Graph "talaguhitan") terms-tg.txt 144-144 Pseudo graph is a subclass of graph

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


(domain CutSetFn 1 Graph) Merge.kif 6096-6096 The number 1 argument of cut set is an instance of graph
(domain MinimalCutSetFn 1 Graph) Merge.kif 6104-6104 The number 1 argument of minimal cut set is an instance of graph
(domain graphMeasure 1 Graph) Merge.kif 6174-6174 The number 1 argument of graph measure is an instance of graph
(domain graphPart 2 Graph) Merge.kif 5914-5914 The number 2 argument of graph part is an instance of graph
(domain subGraph 1 Graph) Merge.kif 5923-5923 The number 1 argument of sub graph is an instance of graph
(domain subGraph 2 Graph) Merge.kif 5924-5924 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 5655-5675
(=>
    (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 5677-5691
(=>
    (instance ?GRAPH Graph)
    (subclass
        (MinimalCutSetFn ?GRAPH)
        (CutSetFn ?GRAPH)))		 Merge.kif 6112-6114

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


(=>
    (instance ?PART GraphElement)
    (exists (?GRAPH)
        (and
            (instance ?GRAPH Graph)
            (graphPart ?PART ?GRAPH))))		 Merge.kif 5850-5855
(=>
    (instance ?TS TransitSystem)
    (exists (?G)
        (and
            (instance ?G Graph)
            (abstractCounterpart ?G ?TS))))		 Transportation.kif 3437-3442


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

Show without tree


Sigma web home      Suggested Upper Merged Ontology (SUMO) web home
Sigma version 3.0 is open source software produced by Articulate Software and its partners