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

Formal Language: 



KB Term:  Term intersection
English Word: 

  subGraph

 Sigma KEE - subGraph
subGraph

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


(documentation subGraph ChineseLanguage "这是形容两个 Graph，而其中一个图是另外一个图的一部分时 的关系，(subGraph ?GRAPH1 ?GRAPH2)的意思是 ?GRAPH1 是 ?GRAPH2 的一部分。") chinese_format.kif 2351-2352
(documentation subGraph EnglishLanguage "The relation between two Graphs when one Graph is a part of the other. (subGraph ?GRAPH1 ?GRAPH2) means that ?GRAPH1 is a part of ?GRAPH2.") Merge.kif 5902-5904
(documentation subGraph JapaneseLanguage "一方の Graph がもう一方の Graph の一部である 場合の2つの Graph の関係。 (subGraph ?GRAPH1 ?GRAPH2) とは、?GRAPH1が ?GRAPH2の一部である ことを意味する。") japanese_format.kif 1027-1029
(domain subGraph 1 Graph) Merge.kif 5899-5899 Die Zahl 1 Argument von subGraph ist ein fall von Graph %n{nicht}
(domain subGraph 2 Graph) Merge.kif 5900-5900 Die Zahl 2 Argument von subGraph ist ein fall von Graph %n{nicht}
(instance subGraph BinaryPredicate) Merge.kif 5896-5896 subGraph ist ein fall von BinaryPredicate %n{nicht}
(instance subGraph ReflexiveRelation) Merge.kif 5897-5897 subGraph ist ein fall von ReflexiveRelation %n{nicht}
(instance subGraph TransitiveRelation) Merge.kif 5898-5898 subGraph ist ein fall von TransitiveRelation %n{nicht}

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


(format ChineseLanguage subGraph "%1 %n 是 %2 的 subGraph") chinese_format.kif 751-751
(format EnglishLanguage subGraph "%1 is %n a subgraph of %2") english_format.kif 753-753
(format FrenchLanguage subGraph "%1 est %n un sous-graph de %2") french_format.kif 453-453
(format ItalianLanguage subGraph "%1 è %n un sottografo di %2") relations-it.txt 273-273
(format JapaneseLanguage subGraph "%1 は %2 の subgraph では %n") japanese_format.kif 2161-2161
(format PortugueseLanguage subGraph "%1 e' %n um sub-grafo de %2") portuguese_format.kif 405-405
(format cz subGraph "%1 %p{je} %n{nen�} podgrafem %2") relations-cz.txt 466-466
(format de subGraph "%1 ist ein teilgraph von %2 %n{nicht}") relations-de.txt 969-969
(format hi subGraph "%1 %2 kaa upagraapha %n hai") relations-hindi.txt 310-310
(format ro subGraph "%1 %n{nu} este un subgraph%t{subgraf} al lui %2") relations-ro.kif 475-475
(format sv subGraph "%1 är %n{inte} en subgraph av %2") relations-sv.txt 518-518
(format tg subGraph "%1 %n ay ang talaguhitan mas baba ng %2") relations-tg.txt 465-465
(termFormat ChineseLanguage subGraph "子图") chinese_format.kif 752-752
(termFormat ChineseTraditionalLanguage subGraph "子圖") domainEnglishFormat.kif 55729-55729
(termFormat EnglishLanguage subGraph "sub graph") domainEnglishFormat.kif 55728-55728

antecedent
-------------------------


(=>
    (and
        (equal
            (PathWeightFn ?PATH) ?SUM)
        (subGraph ?SUBPATH ?PATH)
        (graphPart ?ARC1 ?PATH)
        (arcWeight ?ARC1 ?NUMBER1)
        (forall (?ARC2)
            (=>
                (graphPart ?ARC2 ?PATH)
                (or
                    (graphPart ?ARC2 ?SUBPATH)
                    (equal ?ARC2 ?ARC1)))))
    (equal ?SUM
        (AdditionFn
            (PathWeightFn ?SUBPATH) ?NUMBER1)))		 Merge.kif 5980-5992
(=>
    (and
        (subGraph ?GRAPH1 ?GRAPH2)
        (graphPart ?ELEMENT ?GRAPH1))
    (graphPart ?ELEMENT ?GRAPH2))		 Merge.kif 5906-5910

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


(=>
    (and
        (distanceOnPath ?DIST ?PATH)
        (pathInSystem ?PATH ?SYS)
        (routeStart ?START ?PATH)
        (routeEnd ?END ?PATH)
        (abstractCounterpart ?GRAPH ?SYS))
    (exists (?S ?BN ?EN)
        (and
            (subGraph ?S ?GRAPH)
            (equal ?BN
                (BeginNodeFn ?GRAPH))
            (equal ?EN
                (EndNodeFn ?GRAPH))
            (abstractCounterpart ?BN ?START)
            (abstractCounterpart ?EN ?END))))		 Transportation.kif 2851-2864
(=>
    (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 5631-5651


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