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

Formal Language: 



KB Term:  Term intersection
English Word: 

Sigma KEE - graphPart
graphPart

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


(documentation graphPart ChineseLanguage "这是 Graph 和它的部分之间的一个基本关系。 (graphPart ?PART ?GRAPH) 的意思是 ?PART 是Graph ?GRAPH 的一个 GraphArcGraphNode。") chinese_format.kif 2349-2350
(documentation graphPart EnglishLanguage "A basic relation for Graphs and their parts. (graphPart ?PART ?GRAPH) means that ?PART is a GraphArc or GraphNode of the Graph ?GRAPH.") Merge.kif 5544-5546
(domain graphPart 1 GraphElement) Merge.kif 5541-5541 The number 1 argument of graph part is an instance of graph element
(domain graphPart 2 Graph) Merge.kif 5542-5542 The number 2 argument of graph part is an instance of graph
(instance graphPart AsymmetricRelation) Merge.kif 5538-5538 graph part is an instance of asymmetric relation
(instance graphPart BinaryPredicate) Merge.kif 5537-5537 graph part is an instance of binary predicate
(instance graphPart IrreflexiveRelation) Merge.kif 5540-5540 graph part is an instance of irreflexive relation
(instance graphPart TotalValuedRelation) Merge.kif 5539-5539 graph part is an instance of total valued relation

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


(format ChineseLanguage graphPart "%1 %n 是 %2 的 part") chinese_format.kif 749-749
(format EnglishLanguage graphPart "%1 is %n a part of %2") english_format.kif 754-754
(termFormat ChineseLanguage graphPart "图形部分") chinese_format.kif 750-750
(termFormat ChineseTraditionalLanguage graphPart "圖形部分") domainEnglishFormat.kif 26382-26382
(termFormat EnglishLanguage graphPart "graph part") domainEnglishFormat.kif 26381-26381

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


(=>
    (and
        (equal
            (PathWeightFn ?PATH) ?SUM)
        (graphPart ?ARC1 ?PATH)
        (graphPart ?ARC2 ?PATH)
        (arcWeight ?ARC1 ?NUMBER1)
        (arcWeight ?ARC2 ?NUMBER2)
        (forall (?ARC3)
            (=>
                (graphPart ?ARC3 ?PATH)
                (or
                    (equal ?ARC3 ?ARC1)
                    (equal ?ARC3 ?ARC2)))))
    (equal
        (PathWeightFn ?PATH)
        (AdditionFn ?NUMBER1 ?NUMBER2)))
Merge.kif 5648-5661
(=>
    (and
        (equal
            (PathWeightFn ?PATH) ?SUM)
        (subGraph ?SUBPATH ?PATH)
        (graphPart ?ARC1 ?PATH)
        (arcWeight ?ARC1 ?NUMBER1)
        (forall (?ARC2)
            (=>
                (graphPart ?ARC2 ?PATH)
                (or
                    (graphPart ?ARC2 ?SUBPATH)
                    (equal ?ARC2 ?ARC1)))))
    (equal ?SUM
        (AdditionFn
            (PathWeightFn ?SUBPATH) ?NUMBER1)))
Merge.kif 5634-5646
(=>
    (and
        (graphMeasure ?G ?M)
        (instance ?AN GraphNode)
        (graphPart ?AN ?G)
        (graphPart ?AA ?G)
        (instance ?AA GraphArc)
        (abstractCounterpart ?AN ?PN)
        (abstractCounterpart ?AA ?PA)
        (arcWeight ?AA
            (MeasureFn ?N ?M)))
    (measure ?PA
        (MeasureFn ?N ?M)))
Merge.kif 5826-5836
(=>
    (and
        (graphPart ?PATH ?GRAPH)
        (not
            (instance ?GRAPH DirectedGraph)))
    (<=>
        (instance ?PATH
            (GraphPathFn ?NODE1 ?NODE2))
        (instance ?PATH
            (GraphPathFn ?NODE2 ?NODE1))))
Merge.kif 5723-5729
(=>
    (and
        (instance ?GRAPH DirectedGraph)
        (instance ?ARC GraphArc)
        (graphPart ?ARC ?GRAPH))
    (exists (?NODE1 ?NODE2)
        (and
            (equal
                (InitialNodeFn ?ARC) ?NODE1)
            (equal
                (TerminalNodeFn ?ARC) ?NODE2))))
Merge.kif 5358-5366
(=>
    (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
(=>
    (and
        (instance ?GRAPH GraphPath)
        (instance ?ARC GraphArc)
        (graphPart ?ARC ?GRAPH))
    (=>
        (equal
            (InitialNodeFn ?ARC) ?NODE)
        (not
            (exists (?OTHER)
                (and
                    (equal
                        (InitialNodeFn ?OTHER) ?NODE)
                    (not
                        (equal ?OTHER ?ARC)))))))
Merge.kif 5409-5419
(=>
    (and
        (instance ?GRAPH GraphPath)
        (instance ?ARC GraphArc)
        (graphPart ?ARC ?GRAPH))
    (=>
        (equal
            (TerminalNodeFn ?ARC) ?NODE)
        (not
            (exists (?OTHER)
                (and
                    (equal
                        (TerminalNodeFn ?OTHER) ?NODE)
                    (not
                        (equal ?OTHER ?ARC)))))))
Merge.kif 5421-5431
(=>
    (and
        (subGraph ?GRAPH1 ?GRAPH2)
        (graphPart ?ELEMENT ?GRAPH1))
    (graphPart ?ELEMENT ?GRAPH2))
Merge.kif 5558-5562

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 ?GRAPH PseudoGraph)
    (exists (?LOOP)
        (and
            (instance ?LOOP GraphLoop)
            (graphPart ?LOOP ?GRAPH))))
Merge.kif 5469-5474 A graph is an instance of pseudo graph if and only if there exists a graph element such that the graph element is an instance of graph loop and the graph element is a part of the graph
(=>
    (and
        (instance ?TS TransitSystem)
        (instance ?T Transitway)
        (abstractCounterpart ?G ?TS)
        (systemPart ?T ?TS))
    (exists (?GA)
        (and
            (instance ?GA GraphArc)
            (abstractCounterpart ?GA ?T)
            (graphPart ?GA ?G))))
Transportation.kif 2824-2834
(=>
    (and
        (instance ?TS TransitSystem)
        (instance ?TJ TransitwayJunction)
        (abstractCounterpart ?G ?TS)
        (systemPart ?TJ ?TS))
    (exists (?GN)
        (and
            (instance ?GN GraphNode)
            (abstractCounterpart ?GN ?TJ)
            (graphPart ?GN ?G))))
Transportation.kif 2836-2846
(=>
    (and
        (subGraph ?GRAPH1 ?GRAPH2)
        (graphPart ?ELEMENT ?GRAPH1))
    (graphPart ?ELEMENT ?GRAPH2))
Merge.kif 5558-5562
(=>
    (graphMeasure ?G ?M)
    (forall (?AC)
        (and
            (graphPart ?AC ?G)
            (exists (?PC)
                (abstractCounterpart ?AC ?PC)))))
Merge.kif 5818-5824
(=>
    (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 ?GRAPH Tree)
    (not
        (exists (?ARC1 ?ARC2 ?NODE)
            (and
                (graphPart ?ARC1 ?GRAPH)
                (graphPart ?ARC2 ?GRAPH)
                (graphPart ?NODE ?GRAPH)
                (equal
                    (TerminalNodeFn ?ARC1) ?NODE)
                (equal
                    (TerminalNodeFn ?ARC2) ?NODE)
                (not
                    (equal ?ARC1 ?ARC2))))))
Merge.kif 5389-5399
(=>
    (instance ?GRAPH Tree)
    (not
        (exists (?LOOP)
            (and
                (instance ?LOOP GraphCircuit)
                (graphPart ?LOOP ?GRAPH)))))
Merge.kif 5381-5387
(=>
    (instance ?GRAPH Tree)
    (not
        (exists (?LOOP)
            (and
                (instance ?LOOP GraphLoop)
                (graphPart ?LOOP ?GRAPH)))))
Merge.kif 5373-5379
(=>
    (instance ?PART GraphElement)
    (exists (?GRAPH)
        (and
            (instance ?GRAPH Graph)
            (graphPart ?PART ?GRAPH))))
Merge.kif 5482-5487


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