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

Formal Language: 



KB Term:  Term intersection
English Word: 

Sigma KEE - subGraph
subGraph

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


s__documentation(s__subGraph__m,s__ChineseLanguage,'"这是形容两个 Graph,而其中一个图是另外一个图的一部分时 的关系,(subGraph ?GRAPH1 ?GRAPH2)的意思是 ?GRAPH1 是 ?GRAPH2 的一部分。"')

chinese_format.kif 2351-2352
s__documentation(s__subGraph__m,s__EnglishLanguage,'"The relation between two Graphs when one Graph is a part of the other. (subGraph ?GRAPH1 ?GRAPH2) means that ?GRAPH1 is a part of ?GRAPH2."')

Merge.kif 5544-5546
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
s__instance(s__subGraph__m,s__BinaryPredicate)

s__instance(s__BinaryPredicate,s__SetOrClass)

Merge.kif 5538-5538 sub graph is an instance of binary predicate
s__instance(s__ReflexiveRelation,s__SetOrClass)

s__instance(s__subGraph__m,s__ReflexiveRelation)

Merge.kif 5539-5539 sub graph is an instance of reflexive relation
s__instance(s__TransitiveRelation,s__SetOrClass)

s__instance(s__subGraph__m,s__TransitiveRelation)

Merge.kif 5540-5540 sub graph is an instance of transitive relation

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


s__format(s__ChineseLanguage,s__subGraph__m,'"%1 %n 是 %2 的 subGraph"')

chinese_format.kif 751-751
s__format(s__EnglishLanguage,s__subGraph__m,'"%1 is %n a subgraph of %2"')

english_format.kif 756-756
s__termFormat(s__ChineseLanguage,s__subGraph__m,'"子图"')

chinese_format.kif 752-752
s__termFormat(s__ChineseTraditionalLanguage,s__subGraph__m,'"子圖"')

domainEnglishFormat.kif 55620-55620
s__termFormat(s__EnglishLanguage,s__subGraph__m,'"sub graph"')

domainEnglishFormat.kif 55619-55619

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


( ! [V__SUM,V__NUMBER1,V__SUBPATH,V__ARC1,V__PATH] :
   ((s__instance(V__SUM,s__Quantity) &
       s__instance(V__NUMBER1,s__Quantity) &
       s__instance(V__SUBPATH,s__GraphPath) &
       s__instance(V__ARC1,s__GraphArc) &
       s__instance(V__PATH,s__GraphPath))
     =>
     ((s__PathWeightFn(V__PATH)
       = V__SUM)
     &
     s__subGraph(V__SUBPATH,V__PATH)
   &
   s__graphPart(V__ARC1,V__PATH)
&
s__arcWeight(V__ARC1,V__NUMBER1)
&
( ! [V__ARC2] :
(s__instance(V__ARC2,s__GraphElement) =>
   s__graphPart(V__ARC2,V__PATH)
=>
(s__graphPart(V__ARC2,V__SUBPATH)
|
(V__ARC2 = V__ARC1)))))
=>
(V__SUM = s__AdditionFn(s__PathWeightFn(V__SUBPATH)
,V__NUMBER1))
)
)

Merge.kif 5624-5636
( ! [V__GRAPH1,V__GRAPH2,V__ELEMENT] :
   ((s__instance(V__GRAPH1,s__Graph) &
       s__instance(V__GRAPH2,s__Graph) &
       s__instance(V__ELEMENT,s__GraphElement))
     =>
     (s__subGraph(V__GRAPH1,V__GRAPH2)
     &
     s__graphPart(V__ELEMENT,V__GRAPH1))
=>
s__graphPart(V__ELEMENT,V__GRAPH2)
)
)

Merge.kif 5548-5552

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


( ! [V__END,V__DIST,V__SYS,V__PATH,V__START,V__GRAPH] :
   ((s__instance(V__END,s__Region) &
       s__instance(V__DIST,s__ConstantQuantity) &
       s__instance(V__SYS,s__TransitSystem) &
       s__instance(V__PATH,s__Transitway) &
       s__instance(V__PATH,s__TransitSystem) &
       s__instance(V__START,s__Region) &
       s__instance(V__GRAPH,s__GraphPath))
     =>
     (s__distanceOnPath(V__DIST,V__PATH)
     &
     s__pathInSystem(V__PATH,V__SYS)
   &
   s__routeStart(V__START,V__PATH)
&
s__routeEnd(V__END,V__PATH)
&
s__abstractCounterpart(V__GRAPH,V__SYS))
=>
( ? [V__S, V__BN, V__EN] :
((s__instance(V__S,s__Graph) &
s__instance(V__BN,s__GraphNode) &
s__instance(V__EN,s__GraphNode) &
(s__subGraph(V__S,V__GRAPH)
&
(V__BN = s__BeginNodeFn(V__GRAPH))
&
(V__EN = s__EndNodeFn(V__GRAPH))
&
s__abstractCounterpart(V__BN,V__START)
&
s__abstractCounterpart(V__EN,V__END)))))
)
)

Transportation.kif 2784-2797
( ! [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


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