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

Formal Language: 



KB Term:  Term intersection
English Word: 

  graphPart

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 5797-5799
(domain graphPart 1 GraphElement) Merge.kif 5794-5794 The number 1 argument of graph part is an instance of graph element
(domain graphPart 2 Graph) Merge.kif 5795-5795 The number 2 argument of graph part is an instance of graph
(instance graphPart AsymmetricRelation) Merge.kif 5791-5791 graph part is an instance of asymmetric relation
(instance graphPart BinaryPredicate) Merge.kif 5790-5790 graph part is an instance of binary predicate
(instance graphPart IrreflexiveRelation) Merge.kif 5793-5793 graph part is an instance of irreflexive relation
(instance graphPart TotalValuedRelation) Merge.kif 5792-5792 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 751-751
(termFormat ChineseLanguage graphPart "图形部分") chinese_format.kif 750-750
(termFormat ChineseTraditionalLanguage graphPart "圖形部分") domainEnglishFormat.kif 26450-26450
(termFormat EnglishLanguage graphPart "graph part") domainEnglishFormat.kif 26449-26449

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 5899-5912
(=>
    (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 5885-5897
(=>
    (and
        (graphMeasure ?G ?M)
        (instance ?AN GraphNode)
        (graphPart ?AN ?G)
        (graphPart ?AA ?G)
        (instance ?AA GraphArc)
        (abstractCounterpart ?AN ?PN)
        (abstractCounterpart ?AA ?PA)
        (arcWeight ?AA ?N))
    (measure ?PA
        (MeasureFn ?N ?M)))
Merge.kif 6077-6088
(=>
    (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)))
    (instance ?GRAPH MultiGraph))
Merge.kif 5696-5705
(=>
    (and
        (graphPart ?PATH ?GRAPH)
        (not
            (instance ?GRAPH DirectedGraph)))
    (<=>
        (instance ?PATH
            (GraphPathFn ?NODE1 ?NODE2))
        (instance ?PATH
            (GraphPathFn ?NODE2 ?NODE1))))
Merge.kif 5974-5980
(=>
    (and
        (instance ?GRAPH DirectedGraph)
        (instance ?ARC GraphArc)
        (graphPart ?ARC ?GRAPH))
    (exists (?NODE1 ?NODE2)
        (and
            (equal
                (InitialNodeFn ?ARC) ?NODE1)
            (equal
                (TerminalNodeFn ?ARC) ?NODE2))))
Merge.kif 5583-5591
(=>
    (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 5538-5558
(=>
    (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 5634-5644
(=>
    (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 5646-5656
(=>
    (and
        (instance ?LOOP GraphLoop)
        (graphPart ?LOOP ?GRAPH))
    (instance ?GRAPH PseudoGraph))
Merge.kif 5719-5723
(=>
    (and
        (subGraph ?GRAPH1 ?GRAPH2)
        (graphPart ?ELEMENT ?GRAPH1))
    (graphPart ?ELEMENT ?GRAPH2))
Merge.kif 5811-5815

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


(=>
    (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 2845-2855
(=>
    (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 2857-2867
(=>
    (and
        (subGraph ?GRAPH1 ?GRAPH2)
        (graphPart ?ELEMENT ?GRAPH1))
    (graphPart ?ELEMENT ?GRAPH2))
Merge.kif 5811-5815
(=>
    (graphMeasure ?G ?M)
    (forall (?AC)
        (and
            (graphPart ?AC ?G)
            (exists (?PC)
                (abstractCounterpart ?AC ?PC)))))
Merge.kif 6069-6075
(=>
    (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 5560-5574
(=>
    (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 5683-5694
(=>
    (instance ?GRAPH PseudoGraph)
    (exists (?LOOP)
        (and
            (instance ?LOOP GraphLoop)
            (graphPart ?LOOP ?GRAPH))))
Merge.kif 5712-5717
(=>
    (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 5614-5624
(=>
    (instance ?GRAPH Tree)
    (not
        (exists (?LOOP)
            (and
                (instance ?LOOP GraphCircuit)
                (graphPart ?LOOP ?GRAPH)))))
Merge.kif 5606-5612
(=>
    (instance ?GRAPH Tree)
    (not
        (exists (?LOOP)
            (and
                (instance ?LOOP GraphLoop)
                (graphPart ?LOOP ?GRAPH)))))
Merge.kif 5598-5604
(=>
    (instance ?PART GraphElement)
    (exists (?GRAPH)
        (and
            (instance ?GRAPH Graph)
            (graphPart ?PART ?GRAPH))))
Merge.kif 5731-5736


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 3.0 is open source software produced by Articulate Software and its partners