MinimalWeightedPathFn - Sigma Knowledge base Browser

Browsing Interface : Welcome guest : log in

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

KB Term:			Term intersection

English Word:

Sigma KEE - MinimalWeightedPathFn

MinimalWeightedPathFn

appearance as argument number 1

No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 2372-2373
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5540-5542
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5536-5536	The number 1 argument of minimal weighted path is an instance of graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5537-5537	The number 2 argument of minimal weighted path is an instance of graph node
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5534-5534	Minimal weighted path is an instance of binary function
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5535-5535	Minimal weighted path is an instance of total valued relation
No TPTP formula. May not be expressible in strict first order.	Merge.kif 5538-5538	The range of minimal weighted path is an instance of graph path

appearance as argument number 2

No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 771-771
No TPTP formula. May not be expressible in strict first order.	english_format.kif 774-774
No TPTP formula. May not be expressible in strict first order.	chinese_format.kif 772-772	"最低加权路径函数" is the printable form of minimal weighted path in ChineseLanguage
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 37795-37795	"最小加权路径" is the printable form of minimal weighted path in ChineseLanguage
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 37794-37794	"最小加權路徑" is the printable form of minimal weighted path in ChineseTraditionalLanguage
No TPTP formula. May not be expressible in strict first order.	domainEnglishFormat.kif 37793-37793	"minimal weighted path" is the printable form of minimal weighted path in english language

antecedent

No TPTP formula. May not be expressible in strict first order.	Merge.kif 5548-5557	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 5544-5546	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 2.99c (>= 2017/11/20) is open source software produced by Articulate Software and its partners