InitialNodeFn - Sigma Knowledge base Browser

appearance as argument number 1

(documentation InitialNodeFn ChineseLanguage "这是一个 UnaryFunction，它把一个 GraphArc 和这个 GraphArc的始点联系起来。注：这是一个部分函数，特别是当 GraphArc 不属于 DirectedGraph 时，这会是个为定义的函数。")	chinese_format.kif 2356-2358
(documentation InitialNodeFn EnglishLanguage "A UnaryFunction that maps a GraphArc to the initial node of the GraphArc. Note that this is a partial function. In particular, the function is undefined for GraphArcs that are not part of a DirectedGraph.")	Merge.kif 5823-5826
(domain InitialNodeFn 1 GraphArc)	Merge.kif 5820-5820	The number 1 argument of initial node is an instance of graph arc
(instance InitialNodeFn PartialValuedRelation)	Merge.kif 5819-5819	Initial node is an instance of partial valued relation
(instance InitialNodeFn UnaryFunction)	Merge.kif 5818-5818	Initial node is an instance of unary function
(range InitialNodeFn GraphNode)	Merge.kif 5821-5821	The range of initial node is an instance of graph node

appearance as argument number 2

(format ChineseLanguage InitialNodeFn "%1 节点的起点")	chinese_format.kif 761-761
(format EnglishLanguage InitialNodeFn "the starting node of %1")	english_format.kif 761-761
(relatedInternalConcept BeginNodeFn InitialNodeFn)	Merge.kif 5842-5842	Begin node is internally related to initial node
(termFormat ChineseLanguage InitialNodeFn "初始节点")	domainEnglishFormat.kif 30108-30108
(termFormat ChineseLanguage InitialNodeFn "节点起点函数")	chinese_format.kif 762-762
(termFormat ChineseTraditionalLanguage InitialNodeFn "初始節點")	domainEnglishFormat.kif 30107-30107
(termFormat EnglishLanguage InitialNodeFn "initial node")	domainEnglishFormat.kif 30106-30106

antecedent

(=>
    (and
        (equal
            (InitialNodeFn ?ARC) ?NODE)
        (equal
            (TerminalNodeFn ?ARC) ?NODE))
    (instance ?ARC GraphLoop))

Merge.kif 5764-5768

consequent

(=> (and (instance ?GRAPH DirectedGraph) (instance ?ARC GraphArc) (graphPart ?ARC ?GRAPH)) (exists (?NODE1 ?NODE2) (and (equal (InitialNodeFn ?ARC) ?NODE1) (equal (TerminalNodeFn ?ARC) ?NODE2))))	Merge.kif 5575-5583	If a graph is an instance of directed graph and a graph arc is an instance of graph arc and the graph arc is a part of the graph, then there exist a graph node and another graph node such that the starting node of the graph arc is equal to the graph node and the terminal node of the graph arc is equal to the other graph node
(=> (and (instance ?GRAPH GraphPath) (instance ?ARC GraphArc) (graphPart ?ARC ?GRAPH)) (=> (equal (InitialNodeFn ?ARC) ?NODE) (not (exists (?OTHER) (and (equal (InitialNodeFn ?OTHER) ?NODE) (not (equal ?OTHER ?ARC)))))))	Merge.kif 5626-5636	If a graph is an instance of graph path and a graph arc is an instance of graph arc and the graph arc is a part of the graph, then if the starting node of the graph arc is equal to a graph node, then there doesn't exist another graph arc such that the starting node of the other graph arc is equal to the graph node and the other graph arc is not equal to the graph arc