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


(documentation links ChineseLanguage "这是一个 TernaryPredicate, 它指定联系两个 GraphNodeGraphArc。") chinese_format.kif 2347-2348
(documentation links EnglishLanguage "a TernaryPredicate that specifies the GraphArc connecting two GraphNodes.") Merge.kif 5530-5531
(domain links 1 GraphNode) Merge.kif 5526-5526 The number 1 argument of links is an instance of graph node
(domain links 2 GraphNode) Merge.kif 5527-5527 The number 2 argument of links is an instance of graph node
(domain links 3 GraphArc) Merge.kif 5528-5528 The number 3 argument of links is an instance of graph arc
(instance links TernaryPredicate) Merge.kif 5525-5525 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 752-752
(termFormat ChineseLanguage links "连接") chinese_format.kif 748-748
(termFormat ChineseLanguage links "链接") domainEnglishFormat.kif 34453-34453
(termFormat ChineseTraditionalLanguage links "鏈接") domainEnglishFormat.kif 34452-34452
(termFormat EnglishLanguage links "links") domainEnglishFormat.kif 34451-34451

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


(=>
    (links ?NODE1 ?NODE2 ?ARC)
    (links ?NODE2 ?NODE1 ?ARC))
Merge.kif 5533-5535

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 5452-5462 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 5514-5517 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 2848-2854
(=>
    (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 5313-5333
(=>
    (instance ?ARC GraphArc)
    (exists (?NODE1 ?NODE2)
        (links ?NODE1 ?NODE2 ?ARC)))
Merge.kif 5504-5507
(=>
    (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 5335-5349
(=>
    (instance ?NODE GraphNode)
    (exists (?OTHER ?ARC)
        (links ?NODE ?OTHER ?ARC)))
Merge.kif 5494-5497
(=>
    (links ?NODE1 ?NODE2 ?ARC)
    (links ?NODE2 ?NODE1 ?ARC))
Merge.kif 5533-5535


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