InitialNodeFn - Sigma Knowledge base Browser

Browsing Interface : Welcome guest : log in

[ Home | Graph | ] KB: Language:
Formal Language:

KB Term:			Term intersection

English Word:

Sigma KEE - InitialNodeFn

InitialNodeFn

appearance as argument number 1

No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 2356-2358
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5935-5938
No TPTP formula. May not be expressible in strict first order.	japanese_format.kif 1033-1035
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5932-5932	The number 1 argument of initial node is an instance of graph arc
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5931-5931	Initial node is an instance of partial valued relation
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5930-5930	Initial node is an instance of unary function
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5933-5933	The range of initial node is an instance of graph node

appearance as argument number 2

No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 761-761
No TPTP formula. May not be expressible in strict first order.	english_format.kif 761-761
No TPTP formula. May not be expressible in strict first order.	french_format.kif 460-460
No TPTP formula. May not be expressible in strict first order.	relations-it.txt 146-146
No TPTP formula. May not be expressible in strict first order.	japanese_format.kif 2164-2164
No TPTP formula. May not be expressible in strict first order.	portuguese_format.kif 412-412
No TPTP formula. May not be expressible in strict first order.	relations-de.txt 982-982
No TPTP formula. May not be expressible in strict first order.	relations-hindi.txt 185-185
No TPTP formula. May not be expressible in strict first order.	relations-ro.kif 482-482
No TPTP formula. May not be expressible in strict first order.	relations-sv.txt 526-526
No TPTP formula. May not be expressible in strict first order.	relations-tg.txt 296-296
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5954-5954	Begin node is internally related to initial node
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 30149-30149	Begin node is internally related to initial node
No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 762-762	Begin node is internally related to initial node
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 30148-30148	Begin node is internally related to initial node
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 30147-30147	Begin node is internally related to initial node
No TPTP formula. May not be expressible in strict first order.	terms-de.txt 300-300	Begin node is internally related to initial node
No TPTP formula. May not be expressible in strict first order.	relations-tg.txt 297-297	Begin node is internally related to initial node

antecedent

No TPTP formula. May not be expressible in strict first order.	Merge.kif 5876-5880	If the starting node of a graph arc is equal to a graph node and the terminal node of the graph arc is equal to the graph node, then the graph arc is an instance of graph loop
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5736-5747	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 and 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

consequent

No TPTP formula. May not be expressible in strict first order.	Merge.kif 5685-5693	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
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5736-5747	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 and 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

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