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

Formal Language: 



KB Term:  Term intersection
English Word: 

Sigma KEE - Graph
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 5610-5614
(documentation Graph JapaneseLanguage "グラフの Clas は、グラフが GraphArcs によって接続 された GraphNode のセットであると理解される。注1:この Class には、接続されたグラフのみが含ま れる。 すなわち、グラフは、任意の2つの間にあるGraphPath内にある。注2:すべての Graph には 少なくとも2つの GraphArcs と 3つの GraphNodes が含まれている必要がある。") japanese_format.kif 996-999
(externalImage Graph "http://upload.wikimedia.org/wikipedia/commons/thumb/ 3/ 33/ Cubicpoly.svg/ 255px-Cubicpoly.svg.png") pictureList.kif 1124-1124
(subclass Graph Proposition) Merge.kif 5608-5608 グラフ命題subclass では %n

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


(subclass DirectedGraph Graph) Merge.kif 5654-5654 有向グラフグラフsubclass では %n
(subclass MultiGraph Graph) Merge.kif 5757-5757 マルチグラフグラフsubclass では %n
(subclass PseudoGraph Graph) Merge.kif 5787-5787 疑似グラフグラフsubclass では %n
(termFormat ChineseLanguage Graph "图") chinese_format.kif 933-933
(termFormat EnglishLanguage Graph "graph") english_format.kif 1073-1073
(termFormat FrenchLanguage Graph "graph") french_format.kif 609-609
(termFormat Hindi Graph "aalekha") terms-hindi.txt 140-140
(termFormat ItalianLanguage Graph "Grafo") terms-it.txt 141-141
(termFormat JapaneseLanguage Graph "グラフ") japanese_format.kif 2294-2294
(termFormat PortugueseLanguage Graph "Grafo") portuguese_format.kif 561-561
(termFormat cb Graph "agi") terms-cb.txt 145-145
(termFormat cz Graph "graph") terms-cz.txt 177-177
(termFormat ro Graph "graf") relations-ro.kif 630-630
(termFormat tg Graph "talaguhitan") terms-tg.txt 144-144

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


(domain CutSetFn 1 Graph) Merge.kif 6057-6057 CutSetFn の数値 1 引数は グラフinstance では %n
(domain MinimalCutSetFn 1 Graph) Merge.kif 6065-6065 MinimalCutSetFn の数値 1 引数は グラフinstance では %n
(domain graphMeasure 1 Graph) Merge.kif 6135-6135 graphMeasure の数値 1 引数は グラフinstance では %n
(domain graphPart 2 Graph) Merge.kif 5875-5875 graphPart の数値 2 引数は グラフinstance では %n
(domain subGraph 1 Graph) Merge.kif 5884-5884 subGraph の数値 1 引数は グラフinstance では %n
(domain subGraph 2 Graph) Merge.kif 5885-5885 subGraph の数値 2 引数は グラフinstance では %n

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 5616-5636
(=>
    (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 5638-5652
(=>
    (instance ?GRAPH Graph)
    (subclass
        (MinimalCutSetFn ?GRAPH)
        (CutSetFn ?GRAPH)))
Merge.kif 6073-6075

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


(=>
    (instance ?PART GraphElement)
    (exists (?GRAPH)
        (and
            (instance ?GRAPH Graph)
            (graphPart ?PART ?GRAPH))))
Merge.kif 5811-5816
(=>
    (instance ?TS TransitSystem)
    (exists (?G)
        (and
            (instance ?G Graph)
            (abstractCounterpart ?G ?TS))))
Transportation.kif 2839-2844


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 3.0 is open source software produced by Articulate Software and its partners