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

Formal Language: 



KB Term:  Term intersection
English Word: 

Sigma KEE - GraphNode
GraphNode(graph node)
Cartesian_coordinate, abscissa, co-ordinate, coordinate, intercept, ordinate, origin, polar_coordinate

appearance as argument number 1
-------------------------


s__documentation(s__GraphNode,s__ChineseLanguage,'"Graph 是由 GraphNodeGraphArc 组成,所有的 GraphNode 都是由 GraphArc 联系的."')

chinese_format.kif 2342-2343
s__documentation(s__GraphNode,s__EnglishLanguage,'"Graphs are comprised of GraphNodes and GraphArcs. Every GraphNode is linked by a GraphArc."')

Merge.kif 5481-5482
s__externalImage(s__GraphNode,'"http://upload.wikimedia.org/wikipedia/commons/ 5/ 5b/ 6n-graf.svg"')

pictureList.kif 1792-1792
s__instance(s__GraphElement,s__SetOrClass)

s__instance(s__GraphNode,s__SetOrClass)

s__subclass(s__GraphNode,s__GraphElement)

Merge.kif 5479-5479 Graph node is a subclass of graph element

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


s__partition__3(s__GraphElement,s__GraphNode,s__GraphArc)

Merge.kif 5467-5467 Graph element is exhaustively partitioned into graph node and graph arc
s__range(s__BeginNodeFn__m,s__GraphNode)

Merge.kif 5588-5588 The range of begin node is an instance of graph node
s__range(s__EndNodeFn__m,s__GraphNode)

Merge.kif 5599-5599 The range of end node is an instance of graph node
s__range(s__InitialNodeFn__m,s__GraphNode)

Merge.kif 5568-5568 The range of initial node is an instance of graph node
s__range(s__TerminalNodeFn__m,s__GraphNode)

Merge.kif 5578-5578 The range of terminal node is an instance of graph node
s__termFormat(s__ChineseLanguage,s__GraphNode,'"图节点"')

chinese_format.kif 941-941
s__termFormat(s__EnglishLanguage,s__GraphNode,'"graph node"')

english_format.kif 1094-1094

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


s__domain(s__GraphPathFn__m,n__1,s__GraphNode)

Merge.kif 5705-5705 The number 1 argument of graph path is an instance of graph node
s__domain(s__GraphPathFn__m,n__2,s__GraphNode)

Merge.kif 5706-5706 The number 2 argument of graph path is an instance of graph node
s__domain(s__MaximalWeightedPathFn__m,n__1,s__GraphNode)

Merge.kif 5680-5680 The number 1 argument of maximal weighted path is an instance of graph node
s__domain(s__MaximalWeightedPathFn__m,n__2,s__GraphNode)

Merge.kif 5681-5681 The number 2 argument of maximal weighted path is an instance of graph node
s__domain(s__MinimalWeightedPathFn__m,n__1,s__GraphNode)

Merge.kif 5655-5655 The number 1 argument of minimal weighted path is an instance of graph node
s__domain(s__MinimalWeightedPathFn__m,n__2,s__GraphNode)

Merge.kif 5656-5656 The number 2 argument of minimal weighted path is an instance of graph node
s__domain(s__links__m,n__1,s__GraphNode)

Merge.kif 5516-5516 The number 1 argument of links is an instance of graph node
s__domain(s__links__m,n__2,s__GraphNode)

Merge.kif 5517-5517 The number 2 argument of links is an instance of graph node

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


( ! [V__PA,V__G,V__AN,V__PN,V__M,V__N,V__AA] :
   ((s__instance(V__PA,s__Object) &
       s__instance(V__G,s__Graph) &
       s__instance(V__PN,s__Physical) &
       s__instance(V__M,s__UnitOfMeasure) &
       s__instance(V__N,s__RealNumber))
     =>
     (s__graphMeasure(V__G,V__M)
     &
     s__instance(V__AN,s__GraphNode) &
     s__graphPart(V__AN,V__G)
   &
   s__graphPart(V__AA,V__G)
&
s__instance(V__AA,s__GraphArc) &
s__abstractCounterpart(V__AN,V__PN)
&
s__abstractCounterpart(V__AA,V__PA)
&
s__arcWeight(V__AA,s__MeasureFn(V__N,V__M)))
=>
s__measure(V__PA,s__MeasureFn(V__N,V__M))
)
)

Merge.kif 5816-5826
( ! [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__NODE] :
   (s__instance(V__NODE,s__GraphNode) =>
     ( ? [V__OTHER, V__ARC] :
       ((s__instance(V__OTHER,s__GraphNode) &
           s__instance(V__ARC,s__GraphArc) &
           s__links(V__NODE,V__OTHER,V__ARC))))
   )
)

Merge.kif 5484-5487

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


( ! [V__TJ,V__G,V__TS] :
   (s__instance(V__G,s__Graph) =>
     (s__instance(V__TS,s__TransitSystem) &
       s__instance(V__TJ,s__TransitwayJunction) &
       s__abstractCounterpart(V__G,V__TS)
     &
     s__systemPart(V__TJ,V__TS))
=>
( ? [V__GN] :
   ((s__instance(V__GN,s__GraphNode) &
       s__abstractCounterpart(V__GN,V__TJ)
     &
     s__graphPart(V__GN,V__G))))
)
)

Transportation.kif 2836-2846


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