Browsing Interface : Welcome guest : log in
Home |  Graph |  ]  KB:  Language:   

Formal Language: 



KB Term:  Term intersection
English Word: 

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
-------------------------


s__documentation(s__Graph,s__ChineseLanguage,'"这是图的 Class,我们可以把图理解成一组由 GraphArc 联系 的 GraphNode。注:这个 Class 只包括连通图,即是两个 GraphNode 之间有一个 GraphPath 的图, 也要注意的是每一个 Graph 需要拥有起码两个 GraphArc 和三个 GraphNode。"')

chinese_format.kif 2323-2325
s__documentation(s__Graph,s__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 5297-5301
s__externalImage(s__Graph,'"http://upload.wikimedia.org/wikipedia/commons/thumb/ 3/ 33/ Cubicpoly.svg/ 255px-Cubicpoly.svg.png"')

pictureList.kif 1125-1125
s__subclass(s__Graph,s__Proposition)

s__instance(s__Proposition,s__SetOrClass)

s__instance(s__Graph,s__SetOrClass)

Merge.kif 5295-5295 Graph is a subclass of proposition

appearance as argument number 2
-------------------------


s__subclass(s__DirectedGraph,s__Graph)

s__instance(s__DirectedGraph,s__SetOrClass)

s__instance(s__Graph,s__SetOrClass)

Merge.kif 5341-5341 Directed graph is a subclass of graph
s__subclass(s__MultiGraph,s__Graph)

s__instance(s__MultiGraph,s__SetOrClass)

s__instance(s__Graph,s__SetOrClass)

Merge.kif 5436-5436 Multi graph is a subclass of graph
s__instance(s__PseudoGraph,s__SetOrClass)

s__subclass(s__PseudoGraph,s__Graph)

s__instance(s__Graph,s__SetOrClass)

Merge.kif 5454-5454 Pseudo graph is a subclass of graph
s__termFormat(s__ChineseLanguage,s__Graph,'"图"')

chinese_format.kif 933-933
s__termFormat(s__EnglishLanguage,s__Graph,'"graph"')

english_format.kif 1078-1078

appearance as argument number 3
-------------------------


s__domain(s__CutSetFn__m,n__1,s__Graph)

Merge.kif 5722-5722 The number 1 argument of cut set is an instance of graph
s__domain(s__MinimalCutSetFn__m,n__1,s__Graph)

Merge.kif 5730-5730 The number 1 argument of minimal cut set is an instance of graph
s__domain(s__graphMeasure__m,n__1,s__Graph)

Merge.kif 5800-5800 The number 1 argument of graphMeasure is an instance of graph
s__domain(s__graphPart__m,n__2,s__Graph)

Merge.kif 5532-5532 The number 2 argument of graph part is an instance of graph
s__domain(s__subGraph__m,n__1,s__Graph)

Merge.kif 5541-5541 The number 1 argument of sub graph is an instance of graph
s__domain(s__subGraph__m,n__2,s__Graph)

Merge.kif 5542-5542 The number 2 argument of sub graph is an instance of graph

antecedent
-------------------------


( ! [V__NODE2,V__NODE1,V__GRAPH] :
   ((s__instance(V__GRAPH,s__Graph) &
       s__instance(V__NODE1,s__GraphNode) &
       s__instance(V__NODE2,s__GraphNode) &
       s__graphPart(V__NODE1,V__GRAPH)
     &
     s__graphPart(V__NODE2,V__GRAPH)
   &
   ~((V__NODE1 = V__NODE2)))
=>
( ? [V__ARC, V__PATH] :
   ((s__instance(V__ARC,s__GraphArc) &
       (s__links(V__NODE1,V__NODE2,V__ARC)
       |
       (s__subGraph(V__PATH,V__GRAPH)
       &
       s__instance(V__PATH,s__GraphPath) &
       (((s__BeginNodeFn(V__PATH)
           = V__NODE1)
         &
         (s__EndNodeFn(V__PATH)
         = V__NODE2))
     |
     ((s__BeginNodeFn(V__PATH)
       = V__NODE2)
     &
     (s__EndNodeFn(V__PATH)
     = V__NODE1))))))))
)
)

Merge.kif 5303-5323
( ! [V__GRAPH] :
   (s__instance(V__GRAPH,s__Graph) =>
     ( ? [V__NODE1, V__NODE2, V__NODE3, V__ARC1, V__ARC2] :
       ((s__instance(V__NODE1,s__GraphNode) &
           s__instance(V__NODE2,s__GraphNode) &
           s__instance(V__NODE3,s__GraphNode) &
           s__instance(V__ARC1,s__GraphArc) &
           s__instance(V__ARC2,s__GraphArc) &
           (s__graphPart(V__NODE1,V__GRAPH)
           &
           s__graphPart(V__NODE2,V__GRAPH)
         &
         s__graphPart(V__NODE3,V__GRAPH)
       &
       s__graphPart(V__ARC1,V__GRAPH)
     &
     s__graphPart(V__ARC2,V__GRAPH)
   &
   s__links(V__NODE1,V__NODE2,V__ARC1)
&
s__links(V__NODE2,V__NODE3,V__ARC2)
&
~((V__NODE1 = V__NODE2))
&
~((V__NODE2 = V__NODE3))
&
~((V__NODE1 = V__NODE3))
&
~((V__ARC1 = V__ARC2))))))
)
)

Merge.kif 5325-5339
( ! [V__GRAPH] :
   (s__instance(V__GRAPH,s__Graph) =>
     s__subclass(s__MinimalCutSetFn(V__GRAPH)
  ,s__CutSetFn(V__GRAPH))
)
)

Merge.kif 5738-5740

consequent
-------------------------


( ! [V__PART] :
   (s__instance(V__PART,s__GraphElement) =>
     ( ? [V__GRAPH] :
       ((s__instance(V__GRAPH,s__Graph) &
           s__graphPart(V__PART,V__GRAPH))))
   )
)

Merge.kif 5472-5477
( ! [V__TS] :
   (s__instance(V__TS,s__TransitSystem) =>
     ( ? [V__G] :
       ((s__instance(V__G,s__Graph) &
           s__abstractCounterpart(V__G,V__TS))))
   )
)

Transportation.kif 2817-2822


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