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

 KB Term: Term intersection English Word: Any Noun Verb Adjective Adverb    Graph Sigma KEE - Graph
 Graph(graph)  Cartesian_coordinate_system, bus, bus_topology, coordinate_system, exponential_curve, frame_of_reference, inertial_frame, inertial_reference_frame, logical_topology, loop, loop_topology, mesh, mesh_topology, physical_topology, profile, reference_frame, reference_system, star, star_topology

 appearance as argument number 1 (documentation Graph ChineseLanguage "这是图的 Class，我们可以把图理解成一组由 GraphArc 联系 的 GraphNode。注：这个 Class 只包括连通图，即是两个 GraphNode 之间有一个 GraphPath 的图， 也要注意的是每一个 Graph 需要拥有起码两个 GraphArc 和三个 GraphNode。") chinese_format.kif 2323-2325 (documentation Graph EnglishLanguage "The Class of graphs, where a graph is understood to be a set of GraphNodes connected by GraphArcs. Note that this Class includes only connected graphs, i.e. graphs in which there is a GraphPath between any two GraphNodes. Note too that every Graph is required to contain at least two GraphArcs and three GraphNodes.") Merge.kif 5591-5595 (externalImage Graph "http://upload.wikimedia.org/wikipedia/commons/thumb/ 3/ 33/ Cubicpoly.svg/ 255px-Cubicpoly.svg.png") pictureList.kif 1125-1125 (subclass Graph Proposition) Merge.kif 5589-5589 Graph is a subclass of proposition

 appearance as argument number 2 (subclass DirectedGraph Graph) Merge.kif 5635-5635 Directed graph is a subclass of graph (subclass MultiGraph Graph) Merge.kif 5738-5738 Multi graph is a subclass of graph (subclass PseudoGraph Graph) Merge.kif 5768-5768 Pseudo graph is a subclass of graph (termFormat ChineseLanguage Graph "图") chinese_format.kif 933-933 (termFormat EnglishLanguage Graph "graph") english_format.kif 1073-1073

 appearance as argument number 3 (domain CutSetFn 1 Graph) Merge.kif 6038-6038 The number 1 argument of cut set is an instance of graph (domain MinimalCutSetFn 1 Graph) Merge.kif 6046-6046 The number 1 argument of minimal cut set is an instance of graph (domain graphMeasure 1 Graph) Merge.kif 6116-6116 The number 1 argument of graph measure is an instance of graph (domain graphPart 2 Graph) Merge.kif 5856-5856 The number 2 argument of graph part is an instance of graph (domain subGraph 1 Graph) Merge.kif 5865-5865 The number 1 argument of sub graph is an instance of graph (domain subGraph 2 Graph) Merge.kif 5866-5866 The number 2 argument of sub graph is an instance of graph

 antecedent (=>     (and         (instance ?GRAPH Graph)         (instance ?NODE1 GraphNode)         (instance ?NODE2 GraphNode)         (graphPart ?NODE1 ?GRAPH)         (graphPart ?NODE2 ?GRAPH)         (not             (equal ?NODE1 ?NODE2)))     (exists (?ARC ?PATH)         (or             (links ?NODE1 ?NODE2 ?ARC)             (and                 (subGraph ?PATH ?GRAPH)                 (instance ?PATH GraphPath)                 (or                     (and                         (equal                             (BeginNodeFn ?PATH) ?NODE1)                         (equal                             (EndNodeFn ?PATH) ?NODE2))                     (and                         (equal                             (BeginNodeFn ?PATH) ?NODE2)                         (equal                             (EndNodeFn ?PATH) ?NODE1))))))) Merge.kif 5597-5617 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 (=>     (instance ?GRAPH Graph)     (exists (?NODE1 ?NODE2 ?NODE3 ?ARC1 ?ARC2)         (and             (graphPart ?NODE1 ?GRAPH)             (graphPart ?NODE2 ?GRAPH)             (graphPart ?NODE3 ?GRAPH)             (graphPart ?ARC1 ?GRAPH)             (graphPart ?ARC2 ?GRAPH)             (links ?NODE1 ?NODE2 ?ARC1)             (links ?NODE2 ?NODE3 ?ARC2)             (not                 (equal ?NODE1 ?NODE2))             (not                 (equal ?NODE2 ?NODE3))             (not                 (equal ?NODE1 ?NODE3))             (not                 (equal ?ARC1 ?ARC2))))) Merge.kif 5619-5633 If a graph is an instance of graph,then there exist a graph node, another graph node,, , a third graph node,, , a graph arc and another graph arc such that the graph node is a part of the graph and the other graph node is a part of the graph and the third graph node is a part of the graph and the graph arc is a part of the graph and the other graph arc is a part of the graph and the graph arc links the graph node and the other graph node and the other graph arc links the other graph node and the third graph node and the graph node is not equal to the other graph node and the other graph node is not equal to the third graph node and the graph node is not equal to the third graph node and the graph arc is not equal to the other graph arc (=>     (instance ?GRAPH Graph)     (subclass         (MinimalCutSetFn ?GRAPH)         (CutSetFn ?GRAPH))) Merge.kif 6054-6056 If a graph is an instance of graph,then the set of minimal paths that partition the graph into two separate graphs is a subclass of the set of paths that partition the graph into two separate graphs

 consequent (=>     (instance ?PART GraphElement)     (exists (?GRAPH)         (and             (instance ?GRAPH Graph)             (graphPart ?PART ?GRAPH)))) Merge.kif 5792-5797 If a graph element is an instance of graph element,then there exists a graph such that the graph is an instance of graph and the graph element is a part of the graph (=>     (instance ?TS TransitSystem)     (exists (?G)         (and             (instance ?G Graph)             (abstractCounterpart ?G ?TS)))) Transportation.kif 2839-2844 If a physical is an instance of transit system,then there exists an abstract such that the abstract is an instance of graph and the abstract counterpart of the physical is the abstract 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