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 5636-5639
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5632-5632	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 5631-5631	Begin node is an instance of total valued relation
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5630-5630	Begin node is an instance of unary function
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5633-5633	The range of begin node is an instance of graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5634-5634	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 768-768
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 10523-10523
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 10522-10522
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 10521-10521

consequent

No TPTP formula. May not be expressible in strict first order.	Merge.kif 5474-5479	A graph path is an instance of graph circuit if and only if 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
No TPTP formula. May not be expressible in strict first order.	Transportation.kif 2784-2797	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 5348-5368	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

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