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

Formal Language: 



KB Term:  Term intersection
English Word: 

Sigma KEE - BeginNodeFn
BeginNodeFn

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


(documentation BeginNodeFn ChineseLanguage "这是一个 UnaryFunction，它把一个 GraphPath 联系到 GraphPath 开端的 GraphNode。注：跟 InitialNodeFn 不同 (把一个 GraphArc 和一个 GraphNode 联系)， BeginNodeFn 是一个总体的函数 - 每个 GraphPath 都有它的开端。") chinese_format.kif 2362-2364
(documentation BeginNodeFn EnglishLanguage "A UnaryFunction that maps a GraphPath to the GraphNode that is the beginning of the GraphPath. Note that, unlike InitialNodeFn (which relates a GraphArc to a GraphNode), BeginNodeFn is a total function - every GraphPath has a beginning.") Merge.kif 5946-5949
(documentation BeginNodeFn JapaneseLanguage "UnaryFunction は、GraphPath を GraphPath の先頭である GraphNode にマップする。　注：InitialNodeFn (GraphArc と GraphNode を関 連付ける) とは異なり、BeginNodeFn は完全な関数であり、すべての GraphPath には始まりがある。") japanese_format.kif 1039-1041
(domain BeginNodeFn 1 GraphPath) Merge.kif 5942-5942 Le nombre 1 argument de BeginNodeFn est une instance de chemin du graph
(instance BeginNodeFn TotalValuedRelation) Merge.kif 5941-5941 BeginNodeFn est une instance de relation total
(instance BeginNodeFn UnaryFunction) Merge.kif 5940-5940 BeginNodeFn est une instance de function unaire
(range BeginNodeFn GraphNode) Merge.kif 5943-5943 Le domaine de BeginNodeFn est une instance de noeud du graph
(relatedInternalConcept BeginNodeFn InitialNodeFn) Merge.kif 5944-5944 BeginNodeFn est reli� � l'int�rieur de SUMO � InitialNodeFn

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


(format ChineseLanguage BeginNodeFn "%1 的开端") chinese_format.kif 765-765
(format EnglishLanguage BeginNodeFn "the beginning of %1") english_format.kif 765-765
(format FrenchLanguage BeginNodeFn "le commencement de %1") french_format.kif 462-462
(format ItalianLanguage BeginNodeFn "l' inizio di %1") relations-it.txt 35-35
(format JapaneseLanguage BeginNodeFn "%1 の beginning") japanese_format.kif 2166-2166
(format PortugueseLanguage BeginNodeFn "o comeco de %1") portuguese_format.kif 414-414
(format cb BeginNodeFn "ang sugod sa %1") relations-cb.txt 69-69
(format cz BeginNodeFn "the beginning of %1") relations-cz.txt 475-475
(format de BeginNodeFn "der anfang von %1") relations-de.txt 988-988
(format hi BeginNodeFn "%1 kaa praarambha-noda") relations-hindi.txt 79-79
(format ro BeginNodeFn "beginning%t{începutul} lui %1") relations-ro.kif 484-484
(format sv BeginNodeFn "början för %1") relations-sv.txt 528-528
(format tg BeginNodeFn "ang simula sa %1") relations-tg.txt 86-86
(termFormat ChineseLanguage BeginNodeFn "开始节点") domainEnglishFormat.kif 10571-10571
(termFormat ChineseLanguage BeginNodeFn "节点开端函数") chinese_format.kif 766-766
(termFormat ChineseTraditionalLanguage BeginNodeFn "開始節點") domainEnglishFormat.kif 10570-10570
(termFormat EnglishLanguage BeginNodeFn "begin node") domainEnglishFormat.kif 10569-10569
(termFormat tg BeginNodeFn "tunkulin ng simula buko") relations-tg.txt 87-87

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


(=>
    (and
        (equal
            (BeginNodeFn ?GRAPH) ?NODE)
        (equal
            (EndNodeFn ?GRAPH) ?NODE))
    (instance ?GRAPH GraphCircuit))		 Merge.kif 5765-5769

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 2806-2819
(=>
    (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 5630-5650
(=>
    (instance ?GRAPH GraphCircuit)
    (exists (?NODE)
        (and
            (equal
                (BeginNodeFn ?GRAPH) ?NODE)
            (equal
                (EndNodeFn ?GRAPH) ?NODE))))		 Merge.kif 5758-5763


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