  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 - GraphPath
 GraphPath(graph path) axis, coordinate_axis, dimension, major_axis, major_lobe, minor_axis, optic_axis, principal_axis, semimajor_axis, semiminor_axis, x-axis, y-axis, z-axis

 appearance as argument number 1 No TPTP formula. May not be expressible in strict first order. chinese_format.kif 2330-2333 No TPTP formula. May not be expressible in strict first order. Merge.kif 5438-5442 No TPTP formula. May not be expressible in strict first order. Merge.kif 5436-5436 Graph path is a subclass of directed graph

 appearance as argument number 2 No TPTP formula. May not be expressible in strict first order. Merge.kif 5727-5727 The range of maximal weighted path is an instance of graph path No TPTP formula. May not be expressible in strict first order. Merge.kif 5702-5702 The range of minimal weighted path is an instance of graph path No TPTP formula. May not be expressible in strict first order. Merge.kif 5768-5768 The values returned by cut set are subclasses of graph path No TPTP formula. May not be expressible in strict first order. Merge.kif 5752-5752 The values returned by graph path are subclasses of graph path No TPTP formula. May not be expressible in strict first order. Merge.kif 5776-5776 The values returned by minimal cut set are subclasses of graph path No TPTP formula. May not be expressible in strict first order. Merge.kif 5468-5468 Graph circuit is a subclass of graph path No TPTP formula. May not be expressible in strict first order. chinese_format.kif 936-936 No TPTP formula. May not be expressible in strict first order. english_format.kif 1084-1084

 appearance as argument number 3 No TPTP formula. May not be expressible in strict first order. Merge.kif 5632-5632 The number 1 argument of begin node is an instance of graph path No TPTP formula. May not be expressible in strict first order. Merge.kif 5643-5643 The number 1 argument of end node is an instance of graph path No TPTP formula. May not be expressible in strict first order. Merge.kif 5662-5662 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 5602-5602 The number 1 argument of path length is an instance of graph path

 antecedent No TPTP formula. May not be expressible in strict first order. Merge.kif 5444-5454 If a graph is an instance of graph path and a graph arc is an instance of graph arc and the graph arc is a part of the graph,then if the starting node of the graph arc is equal to a graph node,then there doesn't exist another graph arc such that the starting node of the other graph arc is equal to the graph node and the other graph arc is not equal to the graph arc No TPTP formula. May not be expressible in strict first order. Merge.kif 5456-5466 If a graph is an instance of graph path and a graph arc is an instance of graph arc and the graph arc is a part of the graph,then if the terminal node of the graph arc is equal to a graph node,then there doesn't exist another graph arc such that the terminal node of the other graph arc is equal to the graph node and the other graph arc is not equal to the graph arc

 consequent No TPTP formula. May not be expressible in strict first order. Merge.kif 5348-5368 If a graph is an instance of graph and a graph node is an instance of graph node and another graph node is an instance of graph node and the graph node is a part of the graph and the other graph node is a part of the graph and the graph node is not equal to the other graph node,then there exist a graph arc and a graph path such that the graph arc links the graph node and the other graph node or the graph path is a subgraph of the graph and the graph path is an instance of graph path and the beginning of the graph path is equal to the graph node and the end of the graph path is equal to the other graph node or the beginning of the graph path is equal to the other graph node and the end of the graph path is equal to the graph node No TPTP formula. May not be expressible in strict first order. Transportation.kif 2777-2782 If the distance of a transitway is a constant quantity,then there exists an abstract such that the abstract is an instance of graph path and the abstract counterpart of the transitway is the abstract 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