  Browsing Interface : Welcome guest : log in [  Home |  Graph |  ]  KB:  SUMO Language:  ChineseLanguageChineseTraditionalLanguageChinesehLanguageEnglishLanguageFrenchLanguageGermanLanguageJapaneseLanguageSpanishLanguageSwedishLanguage   Formal Language:  OWLSUO-KIFTPTPtraditionalLogic

 KB Term: Term intersection English Word: Any Noun Verb Adjective Adverb

Sigma KEE - PathWeightFn
 PathWeightFn

 appearance as argument number 1 No TPTP formula. May not be expressible in strict first order. chinese_format.kif 2370-2371 No TPTP formula. May not be expressible in strict first order. Merge.kif 5655-5657 No TPTP formula. May not be expressible in strict first order. Merge.kif 5652-5652 The number 1 argument of path weight is an instance of graph path No TPTP formula. May not be expressible in strict first order. Merge.kif 5651-5651 Path weight is an instance of unary function No TPTP formula. May not be expressible in strict first order. Merge.kif 5653-5653 The range of path weight is an instance of quantity

 appearance as argument number 2 No TPTP formula. May not be expressible in strict first order. chinese_format.kif 769-769 No TPTP formula. May not be expressible in strict first order. english_format.kif 772-772 No TPTP formula. May not be expressible in strict first order. chinese_format.kif 770-770 No TPTP formula. May not be expressible in strict first order. domainEnglishFormat.kif 44704-44704 No TPTP formula. May not be expressible in strict first order. domainEnglishFormat.kif 44703-44703 No TPTP formula. May not be expressible in strict first order. domainEnglishFormat.kif 44702-44702

 antecedent 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 5673-5686 If the value of a graph path is equal to a quantity and a graph arc is a part of the graph path and another graph arc is a part of the graph path and the value of the graph arc is another quantity and the value of the other graph arc is a third quantity and for all a graph element if the graph element is a part of the graph path,then the graph element is equal to the graph arc or the graph element is equal to the other graph arc,then the value of the graph path is equal to (the other quantity and the third quantity) No TPTP formula. May not be expressible in strict first order. Merge.kif 5659-5671 If the value of a graph path is equal to a quantity and another graph path is a subgraph of the graph path and a graph arc is a part of the graph path and the value of the graph arc is another quantity and for all a graph element if the graph element is a part of the graph path,then the graph element is a part of the other graph path or the graph element is equal to the graph arc,then the quantity is equal to (the value of the other graph path and the other quantity)

 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 5673-5686 If the value of a graph path is equal to a quantity and a graph arc is a part of the graph path and another graph arc is a part of the graph path and the value of the graph arc is another quantity and the value of the other graph arc is a third quantity and for all a graph element if the graph element is a part of the graph path,then the graph element is equal to the graph arc or the graph element is equal to the other graph arc,then the value of the graph path is equal to (the other quantity and the third quantity) No TPTP formula. May not be expressible in strict first order. Merge.kif 5659-5671 If the value of a graph path is equal to a quantity and another graph path is a subgraph of the graph path and a graph arc is a part of the graph path and the value of the graph arc is another quantity and for all a graph element if the graph element is a part of the graph path,then the graph element is a part of the other graph path or the graph element is equal to the graph arc,then the quantity is equal to (the value of the other graph path and the other quantity) 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