BeginNodeFn - Sigma Knowledge base Browser

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 5956-5959
(documentation BeginNodeFn JapaneseLanguage "UnaryFunction は、GraphPath を GraphPath の先頭である GraphNode にマップする。　注：InitialNodeFn (GraphArc と GraphNode を関連付ける) とは異なり、BeginNodeFn は完全な関数であり、すべての GraphPath には始まりがある。")	japanese_format.kif 1039-1041
(domain BeginNodeFn 1 GraphPath)	Merge.kif 5952-5952	节点开端函数的 1 数量是图路径的 instance
(instance BeginNodeFn TotalValuedRelation)	Merge.kif 5951-5951	节点开端函数是总值关系的 instance
(instance BeginNodeFn UnaryFunction)	Merge.kif 5950-5950	节点开端函数是一元函数的 instance
(range BeginNodeFn GraphNode)	Merge.kif 5953-5953	节点开端函数的 range 是图节点的实例
(relatedInternalConcept BeginNodeFn InitialNodeFn)	Merge.kif 5954-5954	节点开端函数和节点起点函数是内部相关

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 10578-10578
(termFormat ChineseLanguage BeginNodeFn "节点开端函数")	chinese_format.kif 766-766
(termFormat ChineseTraditionalLanguage BeginNodeFn "開始節點")	domainEnglishFormat.kif 10577-10577
(termFormat EnglishLanguage BeginNodeFn "begin node")	domainEnglishFormat.kif 10576-10576
(termFormat de BeginNodeFn "BeginNullPunktFn")	terms-de.txt 302-302
(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 5775-5779

如果图路径的开端 equal 图节点和那个图路径的末端 equal 那个图节点，
然后那个图路径是图回路的 instance

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 3404-3417	如果公交专用道的 distance 是恒量和运输系统是那个公交专用道在系统里的 path 和地区是那个公交专用道的 start 和另一个地区是那个公交专用道的 end 和那个运输系统的 abstract counterpart 是图路径，然后有存在图，图节点， and 和另一个图节点这样那个图是那个图路径的 subGraph 和那个图节点 equal 那个图路径的开端和那个另外图节点 equal 那个图路径的末端和那个地区的 abstract counterpart 是那个图节点和那个另外地区的 abstract counterpart 是那个另外图节点
(=> (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 5640-5660	如果图是图的 instance 和图节点是图节点的 instance 和另一个图节点是图节点的 instance 和那个图节点是那个图的 part 和那个另外图节点是那个图的 part 和那个图节点不 equal 那个另外图节点，然后有存在图弧和图路径这样那个图弧 links 那个图节点和那个另外图节点或那个图路径是那个图的 subGraph 和那个图路径是图路径的 instance 和那个图路径的开端 equal 那个图节点和那个图路径的末端 equal 那个另外图节点或那个图路径的开端 equal 那个另外图节点和那个图路径的末端 equal 那个图节点
(=> (instance ?GRAPH GraphCircuit) (exists (?NODE) (and (equal (BeginNodeFn ?GRAPH) ?NODE) (equal (EndNodeFn ?GRAPH) ?NODE))))	Merge.kif 5768-5773	如果图路径是图回路的 instance，然后有存在图节点这样那个图路径的开端 equal 那个图节点和那个图路径的末端 equal 那个图节点

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

KB Term:			Term intersection

English Word: