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

Formal Language: 



KB Term:  Term intersection
English Word: 

  links

Sigma KEE - links
links

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


(documentation links ChineseLanguage "这是一个 TernaryPredicate, 它指定联系两个 GraphNodeGraphArc。") Merge.kif 5981-5982
(documentation links EnglishLanguage "a TernaryPredicate that specifies the GraphArc connecting two GraphNodes.") Merge.kif 5979-5980
(domain links 1 GraphNode) Merge.kif 5976-5976 The number 1 argument of links is an instance of graph node
(domain links 2 GraphNode) Merge.kif 5977-5977 The number 2 argument of links is an instance of graph node
(domain links 3 GraphArc) Merge.kif 5978-5978 The number 3 argument of links is an instance of graph arc
(instance links TernaryPredicate) Merge.kif 5975-5975 links is an instance of ternary predicate

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


(format ChineseLanguage links "%3 %n{doesn't} links %1 和 %2") chinese_format.kif 747-747
(format EnglishLanguage links "%3 %n{doesn't} link%p{s} %1 and %2") english_format.kif 462-462
(termFormat ChineseLanguage links "连接") chinese_format.kif 748-748 "连接" is the printable form of links in ChineseLanguage
(termFormat EnglishLanguage links "links") domainEnglishFormat.kif 6178-6178 "links" is the printable form of links in english language

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


(=>
    (links ?NODE1 ?NODE2 ?ARC)
    (links ?NODE2 ?NODE1 ?ARC))
Merge.kif 5984-5986

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


(<=>
    (instance ?GRAPH MultiGraph)
    (exists (?ARC1 ?ARC2 ?NODE1 ?NODE2)
        (and
            (graphPart ?ARC1 ?GRAPH)
            (graphPart ?ARC2 ?GRAPH)
            (graphPart ?NODE1 ?GRAPH)
            (graphPart ?NODE2 ?GRAPH)
            (links ?NODE1 ?NODE2 ?ARC1)
            (links ?NODE1 ?NODE2 ?ARC2)
            (not
                (equal ?ARC1 ?ARC2)))))
Merge.kif 5898-5908 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
(<=>
    (instance ?LOOP GraphLoop)
    (exists (?NODE)
        (links ?NODE ?NODE ?LOOP)))
Merge.kif 5964-5967 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
(=>
    (and
        (connects ?A ?NODE1 ?NODE2)
        (abstractCounterpart ?N1 ?NODE1)
        (abstractCounterpart ?N2 ?NODE2)
        (abstractCounterpart ?ARC ?A))
    (links ?N1 ?N2 ?ARC))
Transportation.kif 2814-2820
(=>
    (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 5752-5772
(=>
    (instance ?ARC GraphArc)
    (exists (?NODE1 ?NODE2)
        (links ?NODE1 ?NODE2 ?ARC)))
Merge.kif 5954-5957
(=>
    (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 5774-5788
(=>
    (instance ?NODE GraphNode)
    (exists (?OTHER ?ARC)
        (links ?NODE ?OTHER ?ARC)))
Merge.kif 5943-5946
(=>
    (links ?NODE1 ?NODE2 ?ARC)
    (links ?NODE2 ?NODE1 ?ARC))
Merge.kif 5984-5986


Show simplified definition (without tree view)
Show simplified definition (with tree view)

Show without tree


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