Select language: english | cesky | deutsch | italiano | simplified chinese | traditional chinese | hindi
Concept:
English word:
Home

lian2 jie2 (links)

a TernaryPredicate that specifies the GraphArc connecting two GraphNodes.

Ontology

SUMO / GRAPH-THEORY

Class(es)

zhong3 lei4
is instance of
  ke3 ji4 cheng2 guan1 xi4  
is instance of
  san1 yuan2 shu4 ci2  
is instance of
  lian2 jie2  

Coordinate term(s)

biao1 gao1  jie4 yu1  neng2 li4  tiao2 jian4 huo4 ran2 lv4  fu4 yu3 yi4 wu4  fu4 yu3 quan2 li4  xiang1 lian2  shen1 du4  ju4 li2  ling3 yu4  ling3 yu4 ci4 zhong3 lei4  shi1 shi4 zhe3 you3 yi4 tu2  you3...zhi2 wei4  xiang4 dui4 fang1 wei4  pian1 ai4  SUMOwai4 bu4 xiang1 guan1 gai4 nian4  shi1 shi4 zhe3 cheng2 xian4  yi3...yu3 yan2 cheng2 xian4  shi2 jian1 jie4 yu1  shi2 jian1 jie4 yu1 huo4 tong5 shi2 

Type restrictions

links(tu2 jie2 dian3, tu2 jie2 dian3, tu2 hu2 xian4)

Axioms (7)

If graph shi4 tu2 de5 shi2 li4 and node1 shi4 tu2 jie2 dian3 de5 shi2 li4 and node2 shi4 tu2 jie2 dian3 de5 shi2 li4 and node1 shi4 graph de5 bu4 fen5 and node2 shi4 graph de5 bu4 fen5 and node1 deng3 yu1 node2, then there exist arc,path so_that_not 
(=>
      (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)))))))
If graph shi4 tu2 de5 shi2 li4, then there exist node1,node2,node3,arc1,arc2 so_that_not node1 shi4 graph de5 bu4 fen5 and node2 shi4 graph de5 bu4 fen5 and node3 shi4 graph de5 bu4 fen5 and arc1 shi4 graph de5 bu4 fen5 and arc2 shi4 graph de5 bu4 fen5 and node2 (mei2) lian2 jie2not(s) arc1 he2 node1 and node3 (mei2) lian2 jie2not(s) arc2 he2 node2 and node1 deng3 yu1 node2 and node2 deng3 yu1 node3 and node1 deng3 yu1 node3 and arc1 deng3 yu1 arc2. 
(=>
      (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 ?ARC1 ?NODE1 ?NODE2)
                  (links ?ARC2 ?NODE2 ?NODE3)
                  (not
                        (equal ?NODE1 ?NODE2))
                  (not
                        (equal ?NODE2 ?NODE3))
                  (not
                        (equal ?NODE1 ?NODE3))
                  (not
                        (equal ?ARC1 ?ARC2)))))
graph shi4 duo1 tu2 de5 shi2 li4 if and only if there exist arc1,arc2,node1,node2 so_that_not arc1 shi4 graph de5 bu4 fen5 and arc2 shi4 graph de5 bu4 fen5 and node1 shi4 graph de5 bu4 fen5 and node2 shi4 graph de5 bu4 fen5 and arc1 (mei2) lian2 jie2not(s) node1 he2 node2 and arc2 (mei2) lian2 jie2not(s) node1 he2 node2 and arc1 deng3 yu1 arc2. 
(<=>
      (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)))))
If node shi4 tu2 jie2 dian3 de5 shi2 li4, then there exist other,arc so_that_not arc (mei2) lian2 jie2not(s) node he2 other. 
(=>
      (instance ?NODE GraphNode)
      (exists
            (?OTHER ?ARC)
            (links ?NODE ?OTHER ?ARC)))
If arc shi4 tu2 hu2 xian4 de5 shi2 li4, then there exist node1,node2 so_that_not arc (mei2) lian2 jie2not(s) node1 he2 node2. 
(=>
      (instance ?ARC GraphArc)
      (exists
            (?NODE1 ?NODE2)
            (links ?NODE1 ?NODE2 ?ARC)))
loop shi4 tu2 hui2 quan1 de5 shi2 li4 if and only if there exists node so_that_not loop (mei2) lian2 jie2not(s) node he2 node. 
(<=>
      (instance ?LOOP GraphLoop)
      (exists
            (?NODE)
            (links ?NODE ?NODE ?LOOP)))
If arc (mei2) lian2 jie2not(s) node1 he2 node2, then arc (mei2) lian2 jie2not(s) node2 he2 node1. 
(=>
      (links ?NODE1 ?NODE2 ?ARC)
      (links ?NODE2 ?NODE1 ?ARC))