TreeView Knowledge Base Browser - GraphPathFn

Browsing Interface : Welcome guest : log in

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

KB Term:			Term intersection

English Word:

Sigma KEE - GraphPathFn

GraphPathFn

appearance as argument number 1

No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 2376-2377
No TPTP formula. May not be expressible in strict first order.	Merge.kif 6059-6061
No TPTP formula. May not be expressible in strict first order.	japanese_format.kif 1053-1055
No TPTP formula. May not be expressible in strict first order.	Merge.kif 6055-6055	The number 1 argument of graph path is an instance of graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 6056-6056	The number 2 argument of graph path is an instance of graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 6053-6053	Graph path is an instance of binary function
No TPTP formula. May not be expressible in strict first order.	Merge.kif 6054-6054	Graph path is an instance of total valued relation
No TPTP formula. May not be expressible in strict first order.	Merge.kif 6057-6057	The values returned by graph path are subclasses of graph path

appearance as argument number 2

No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 775-775
No TPTP formula. May not be expressible in strict first order.	english_format.kif 775-775
No TPTP formula. May not be expressible in strict first order.	french_format.kif 467-467
No TPTP formula. May not be expressible in strict first order.	relations-it.txt 120-120
No TPTP formula. May not be expressible in strict first order.	japanese_format.kif 2171-2171
No TPTP formula. May not be expressible in strict first order.	portuguese_format.kif 419-419
No TPTP formula. May not be expressible in strict first order.	relations-de.txt 1003-1003
No TPTP formula. May not be expressible in strict first order.	relations-hindi.txt 160-160
No TPTP formula. May not be expressible in strict first order.	relations-ro.kif 489-489
No TPTP formula. May not be expressible in strict first order.	relations-sv.txt 537-537
No TPTP formula. May not be expressible in strict first order.	relations-tg.txt 247-247
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 26466-26466
No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 776-776
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 26465-26465
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 26464-26464

antecedent

No TPTP formula. May not be expressible in strict first order.	Merge.kif 6045-6051	If the highest cost path between a graph node and another graph node is equal to a graph path and the value of the graph path is equal to a real number and the graph path2 is an instance of the set of paths between the graph node and the other graph node and the value of the graph path2 is equal to another real number, then the other real number is less than or equal to the real number
No TPTP formula. May not be expressible in strict first order.	Merge.kif 6023-6029	If the lowest cost path between a graph node and another graph node is equal to a graph path and the value of the graph path is equal to a real number and the graph path2 is an instance of the set of paths between the graph node and the other graph node and the value of the graph path2 is equal to another real number, then the other real number is greater than or equal to the real number

consequent

No TPTP formula. May not be expressible in strict first order.	Merge.kif 6063-6069	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 6041-6043	If the highest cost path between a graph node and another graph node is equal to a graph path, then the graph path is an instance of the set of paths between the graph node and the other graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 6019-6021	If the lowest cost path between a graph node and another graph node is equal to a graph path, then the graph path is an instance of the set of paths between the graph node and 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