TreeView Knowledge Base Browser - BeginNodeFn

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

No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 2362-2364
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5971-5974
No TPTP formula. May not be expressible in strict first order.	japanese_format.kif 1039-1041
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5967-5967	The number 1 argument of begin node is an instance of graph path
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5966-5966	Begin node is an instance of total valued relation
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5965-5965	Begin node is an instance of unary function
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5968-5968	The range of begin node is an instance of graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5969-5969	Begin node is internally related to initial node

appearance as argument number 2

No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 765-765
No TPTP formula. May not be expressible in strict first order.	english_format.kif 765-765
No TPTP formula. May not be expressible in strict first order.	french_format.kif 462-462
No TPTP formula. May not be expressible in strict first order.	relations-it.txt 35-35
No TPTP formula. May not be expressible in strict first order.	japanese_format.kif 2166-2166
No TPTP formula. May not be expressible in strict first order.	portuguese_format.kif 414-414
No TPTP formula. May not be expressible in strict first order.	relations-cb.txt 69-69
No TPTP formula. May not be expressible in strict first order.	relations-cz.txt 475-475
No TPTP formula. May not be expressible in strict first order.	relations-de.txt 988-988
No TPTP formula. May not be expressible in strict first order.	relations-hindi.txt 79-79
No TPTP formula. May not be expressible in strict first order.	relations-ro.kif 484-484
No TPTP formula. May not be expressible in strict first order.	relations-sv.txt 528-528
No TPTP formula. May not be expressible in strict first order.	relations-tg.txt 86-86
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 10578-10578
No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 766-766
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 10577-10577
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 10576-10576
No TPTP formula. May not be expressible in strict first order.	terms-de.txt 302-302
No TPTP formula. May not be expressible in strict first order.	relations-tg.txt 87-87

antecedent

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

Merge.kif 5790-5794

If equal the beginning of a graph path and a graph node and equal the end of the graph path and 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 3404-3417	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 equal the graph node and the beginning of the graph path and equal the other graph node and 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 5655-5675	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 equal the graph node and 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 equal the beginning of the graph path and the graph node and equal the end of the graph path and the other graph node or equal the beginning of the graph path and the other graph node and equal the end of the graph path and the graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5783-5788	If a graph path is an instance of graph circuit, then there exists a graph node such that equal the beginning of the graph path and the graph node and equal the end of the graph path and the graph node

Show simplified definition (without tree view)
Show simplified definition (with tree view)

Show without tree

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