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

Formal Language: 



KB Term:  Term intersection
English Word: 

Sigma KEE - links
links

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


s__documentation(s__links__m,s__ChineseLanguage,'"这是一个 TernaryPredicate, 它指定联系两个 GraphNodeGraphArc。"')

chinese_format.kif 2347-2348
s__documentation(s__links__m,s__EnglishLanguage,'"a TernaryPredicate that specifies the GraphArc connecting two GraphNodes."')

Merge.kif 5520-5521
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
s__domain(s__links__m,n__3,s__GraphArc)

Merge.kif 5518-5518 The number 3 argument of links is an instance of graph arc
s__instance(s__TernaryPredicate,s__SetOrClass)

s__instance(s__links__m,s__TernaryPredicate)

Merge.kif 5515-5515 links is an instance of ternary predicate

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


s__format(s__ChineseLanguage,s__links__m,'"%3 %n{doesnt} links %1 和 %2"')

chinese_format.kif 747-747
s__format(s__EnglishLanguage,s__links__m,'"%3 %n{doesnt} link%p{s} %1 and %2"')

english_format.kif 752-752
s__termFormat(s__ChineseLanguage,s__links__m,'"连接"')

chinese_format.kif 748-748
s__termFormat(s__ChineseLanguage,s__links__m,'"链接"')

domainEnglishFormat.kif 34453-34453
s__termFormat(s__ChineseTraditionalLanguage,s__links__m,'"鏈接"')

domainEnglishFormat.kif 34452-34452
s__termFormat(s__EnglishLanguage,s__links__m,'"links"')

domainEnglishFormat.kif 34451-34451

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


( ! [V__NODE2,V__NODE1,V__ARC] :
   ((s__instance(V__NODE2,s__GraphNode) &
       s__instance(V__NODE1,s__GraphNode) &
       s__instance(V__ARC,s__GraphArc))
     =>
     s__links(V__NODE1,V__NODE2,V__ARC)
   =>
   s__links(V__NODE2,V__NODE1,V__ARC)
)
)

Merge.kif 5523-5525

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


( ! [V__GRAPH] :
   ((s__instance(V__GRAPH,s__MultiGraph) =>
       ( ? [V__ARC1, V__ARC2, V__NODE1, V__NODE2] :
         ((s__instance(V__ARC1,s__GraphArc) &
             s__instance(V__ARC2,s__GraphArc) &
             s__instance(V__NODE1,s__GraphNode) &
             s__instance(V__NODE2,s__GraphNode) &
             (s__graphPart(V__ARC1,V__GRAPH)
             &
             s__graphPart(V__ARC2,V__GRAPH)
           &
           s__graphPart(V__NODE1,V__GRAPH)
         &
         s__graphPart(V__NODE2,V__GRAPH)
       &
       s__links(V__NODE1,V__NODE2,V__ARC1)
     &
     s__links(V__NODE1,V__NODE2,V__ARC2)
   &
   ~((V__ARC1 = V__ARC2)))))))
&
(( ? [V__ARC1, V__ARC2, V__NODE1, V__NODE2] :
((s__instance(V__ARC1,s__GraphArc) &
s__instance(V__ARC2,s__GraphArc) &
s__instance(V__NODE1,s__GraphNode) &
s__instance(V__NODE2,s__GraphNode) &
(s__graphPart(V__ARC1,V__GRAPH)
&
s__graphPart(V__ARC2,V__GRAPH)
&
s__graphPart(V__NODE1,V__GRAPH)
&
s__graphPart(V__NODE2,V__GRAPH)
&
s__links(V__NODE1,V__NODE2,V__ARC1)
&
s__links(V__NODE1,V__NODE2,V__ARC2)
&
~((V__ARC1 = V__ARC2))))))
=>
s__instance(V__GRAPH,s__MultiGraph))
)
)

Merge.kif 5442-5452 A graph is an instance of multi graph if and only if there exist a graph arc, another graph arc,, , a graph node and another graph node such that the graph arc is a part of the graph and the other graph arc is a part of the graph and the graph node is a part of the graph and the other graph node 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 graph node and the other graph node and the graph arc is not equal to the other graph arc
( ! [V__LOOP] :
   ((s__instance(V__LOOP,s__GraphLoop) =>
       ( ? [V__NODE] :
         ((s__instance(V__NODE,s__GraphNode) &
             s__links(V__NODE,V__NODE,V__LOOP)))))
   &
   (( ? [V__NODE] :
       ((s__instance(V__NODE,s__GraphNode) &
           s__links(V__NODE,V__NODE,V__LOOP))))
   =>
   s__instance(V__LOOP,s__GraphLoop))
)
)

Merge.kif 5504-5507 A graph arc is an instance of graph loop if and only if there exists a graph node such that the graph arc links the graph node and the graph node
( ! [V__NODE2,V__NODE1,V__A,V__N1,V__N2,V__ARC] :
   ((s__instance(V__NODE2,s__Object) &
       s__instance(V__NODE1,s__Object) &
       s__instance(V__A,s__Object) &
       s__instance(V__N1,s__GraphNode) &
       s__instance(V__N2,s__GraphNode) &
       s__instance(V__ARC,s__GraphArc))
     =>
     (s__connects(V__A,V__NODE1,V__NODE2)
     &
     s__abstractCounterpart(V__N1,V__NODE1)
   &
   s__abstractCounterpart(V__N2,V__NODE2)
&
s__abstractCounterpart(V__ARC,V__A))
=>
s__links(V__N1,V__N2,V__ARC)
)
)

Transportation.kif 2848-2854
( ! [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__ARC] :
   (s__instance(V__ARC,s__GraphArc) =>
     ( ? [V__NODE1, V__NODE2] :
       ((s__instance(V__NODE1,s__GraphNode) &
           s__instance(V__NODE2,s__GraphNode) &
           s__links(V__NODE1,V__NODE2,V__ARC))))
   )
)

Merge.kif 5494-5497
( ! [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__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
( ! [V__NODE2,V__NODE1,V__ARC] :
   ((s__instance(V__NODE2,s__GraphNode) &
       s__instance(V__NODE1,s__GraphNode) &
       s__instance(V__ARC,s__GraphArc))
     =>
     s__links(V__NODE1,V__NODE2,V__ARC)
   =>
   s__links(V__NODE2,V__NODE1,V__ARC)
)
)

Merge.kif 5523-5525


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