TreeView Knowledge Base Browser - DirectedGraph

Browsing Interface : Welcome guest : log in

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

KB Term:			Term intersection

English Word:

Sigma KEE - DirectedGraph

DirectedGraph(directed graph)

appearance as argument number 1

No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 2326-2328
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5670-5673
No TPTP formula. May not be expressible in strict first order.	japanese_format.kif 1000-1002
No TPTP formula. May not be expressible in strict first order.	pictureList.kif 1728-1728
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5668-5668	Directed graph is a subclass of graph

appearance as argument number 2

No TPTP formula. May not be expressible in strict first order.	Merge.kif 5718-5718	Graph path is a subclass of directed graph
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5685-5685	Tree is a subclass of directed graph
No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 934-934
No TPTP formula. May not be expressible in strict first order.	english_format.kif 1075-1075
No TPTP formula. May not be expressible in strict first order.	french_format.kif 610-610
No TPTP formula. May not be expressible in strict first order.	terms-hindi.txt 141-141
No TPTP formula. May not be expressible in strict first order.	terms-it.txt 144-144
No TPTP formula. May not be expressible in strict first order.	japanese_format.kif 2295-2295
No TPTP formula. May not be expressible in strict first order.	portuguese_format.kif 562-562
No TPTP formula. May not be expressible in strict first order.	terms-cz.txt 178-178
No TPTP formula. May not be expressible in strict first order.	relations-ro.kif 631-631
No TPTP formula. May not be expressible in strict first order.	terms-tg.txt 145-145

antecedent

No TPTP formula. May not be expressible in strict first order.	Merge.kif 6062-6068	If a graph element is a part of a graph and the graph is not an instance of directed graph, then the graph element is an instance of the set of paths between a graph node and another graph node if and only if the graph element is an instance of the set of paths between the other graph node and the graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5675-5683	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

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