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

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

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 5623-5625 No TPTP formula. May not be expressible in strict first order. Merge.kif 5619-5619 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 5620-5620 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 5617-5617 Graph path is an instance of binary function No TPTP formula. May not be expressible in strict first order. Merge.kif 5618-5618 Graph path is an instance of total valued relation No TPTP formula. May not be expressible in strict first order. Merge.kif 5621-5621 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 26395-26395 "图形路径" is the printable form of graph path in ChineseLanguage No TPTP formula. May not be expressible in strict first order. chinese_format.kif 776-776 "图路函数" is the printable form of graph path in ChineseLanguage No TPTP formula. May not be expressible in strict first order. domainEnglishFormat.kif 26394-26394 "圖形路徑" is the printable form of graph path in ChineseTraditionalLanguage No TPTP formula. May not be expressible in strict first order. domainEnglishFormat.kif 26393-26393 "graph path" is the printable form of graph path in english language

 consequent No TPTP formula. May not be expressible in strict first order. Merge.kif 5606-5615 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 5581-5590 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 5627-5633 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 5602-5604 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 5577-5579 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