EndNodeFn - Sigma Knowledge base Browser

Browsing Interface : Welcome guest : log in

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

KB Term:			Term intersection

English Word:

Sigma KEE - EndNodeFn

EndNodeFn

appearance as argument number 1

No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 2365-2367
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5957-5960
No TPTP formula. May not be expressible in strict first order.	japanese_format.kif 1042-1044
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5953-5953	The number 1 argument of end node is an instance of graph path
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5952-5952	End node is an instance of total valued relation
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5951-5951	End node is an instance of unary function
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5954-5954	The range of end node is an instance of graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5955-5955	End node is internally related to terminal node

appearance as argument number 2

No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 767-767
No TPTP formula. May not be expressible in strict first order.	english_format.kif 767-767
No TPTP formula. May not be expressible in strict first order.	french_format.kif 463-463
No TPTP formula. May not be expressible in strict first order.	relations-it.txt 93-93
No TPTP formula. May not be expressible in strict first order.	japanese_format.kif 2167-2167
No TPTP formula. May not be expressible in strict first order.	portuguese_format.kif 415-415
No TPTP formula. May not be expressible in strict first order.	relations-cz.txt 476-476
No TPTP formula. May not be expressible in strict first order.	relations-de.txt 991-991
No TPTP formula. May not be expressible in strict first order.	relations-hindi.txt 133-133
No TPTP formula. May not be expressible in strict first order.	relations-ro.kif 485-485
No TPTP formula. May not be expressible in strict first order.	relations-sv.txt 530-530
No TPTP formula. May not be expressible in strict first order.	relations-tg.txt 201-201
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 22048-22048
No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 768-768
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 22047-22047
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 22046-22046
No TPTP formula. May not be expressible in strict first order.	relations-tg.txt 202-202

antecedent

No TPTP formula. May not be expressible in strict first order.

Merge.kif 5765-5769

If the beginning of a graph path is equal to a graph node and the end of the graph path is equal to the graph node,
then the graph path is an instance of graph circuit

consequent

No TPTP formula. May not be expressible in strict first order.	Transportation.kif 2806-2819	If the distance of a transitway is a constant quantity and a transit system is a path in system of the transitway and a region is the start of the transitway and another region is the end of the transitway and the abstract counterpart of the transit system is a graph path, then there exist a graph, a graph node and another graph node such that the graph is a subgraph of the graph path and the graph node is equal to the beginning of the graph path and the other graph node is equal to the end of the graph path and the abstract counterpart of the region is the graph node and the abstract counterpart of the other region is the other graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5630-5650	If a graph is an instance of graph and a graph node is an instance of graph node and another graph node is an instance of graph node and the graph node is a part of the graph and the other graph node is a part of the graph and the graph node is not equal to the other graph node, then there exist a graph arc and a graph path such that the graph arc links the graph node and the other graph node or the graph path is a subgraph of the graph and the graph path is an instance of graph path and the beginning of the graph path is equal to the graph node and the end of the graph path is equal to the other graph node or the beginning of the graph path is equal to the other graph node and the end of the graph path is equal to the graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5758-5763	If a graph path is an instance of graph circuit, then 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

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