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 5626-5629
(domain BeginNodeFn 1 GraphPath) Merge.kif 5622-5622 The number 1 argument of begin node is an instance of graph path
(instance BeginNodeFn TotalValuedRelation) Merge.kif 5621-5621 Begin node is an instance of total valued relation
(instance BeginNodeFn UnaryFunction) Merge.kif 5620-5620 Begin node is an instance of unary function
(range BeginNodeFn GraphNode) Merge.kif 5623-5623 The range of begin node is an instance of graph node
(relatedInternalConcept BeginNodeFn InitialNodeFn) Merge.kif 5624-5624 Begin node is internally related to initial node

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


(format ChineseLanguage BeginNodeFn "%1 的开端") chinese_format.kif 765-765
(format EnglishLanguage BeginNodeFn "the beginning of %1") english_format.kif 768-768
(termFormat ChineseLanguage BeginNodeFn "开始节点") domainEnglishFormat.kif 10519-10519
(termFormat ChineseLanguage BeginNodeFn "节点开端函数") chinese_format.kif 766-766
(termFormat ChineseTraditionalLanguage BeginNodeFn "開始節點") domainEnglishFormat.kif 10518-10518
(termFormat EnglishLanguage BeginNodeFn "begin node") domainEnglishFormat.kif 10517-10517

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


(<=>
    (instance ?GRAPH GraphCircuit)
    (exists (?NODE)
        (and
            (equal
                (BeginNodeFn ?GRAPH) ?NODE)
            (equal
                (EndNodeFn ?GRAPH) ?NODE))))
Merge.kif 5464-5469 A graph path is an instance of graph circuit if and only if there exists a graph node such that the beginning of the graph path is equal to the graph node and the end of the graph path is equal to the graph node
(=>
    (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 2784-2797
(=>
    (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 5338-5358


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