GraphPathFn - Sigma Knowledge base Browser

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 6083-6085
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 6079-6079	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 6080-6080	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 6077-6077	Graph path is an instance of binary function
No TPTP formula. May not be expressible in strict first order.	Merge.kif 6078-6078	Graph path is an instance of total valued relation
No TPTP formula. May not be expressible in strict first order.	Merge.kif 6081-6081	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 26477-26477
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 26476-26476
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 26475-26475
No TPTP formula. May not be expressible in strict first order.	terms-de.txt 307-307

antecedent

No TPTP formula. May not be expressible in strict first order.	Merge.kif 6069-6075	If equal the highest cost path between a graph node and another graph node and a graph path and equal the value of the graph path and 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 equal the value of the graph path2 and 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 6047-6053	If equal the lowest cost path between a graph node and another graph node and a graph path and equal the value of the graph path and 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 equal the value of the graph path2 and 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 6087-6093	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 6065-6067	If equal the highest cost path between a graph node and another graph node and 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 6043-6045	If equal the lowest cost path between a graph node and another graph node and 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 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