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 5744-5746
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5740-5740	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 5741-5741	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 5738-5738	Graph path is an instance of binary function
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5739-5739	Graph path is an instance of total valued relation
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5742-5742	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 778-778
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 26389-26389
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 26388-26388
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 26387-26387

consequent

No TPTP formula. May not be expressible in strict first order.	Merge.kif 5727-5736	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 quantity, then for all the graph path2 if 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 quantity, then the other quantity is less than or equal to the quantity
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5702-5711	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 quantity, then for all the graph path2 if 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 quantity, then the other quantity is greater than or equal to the quantity
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5748-5754	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 5723-5725	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 5698-5700	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 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