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


KB Term:  Term intersection
English Word: 

Sigma KEE - GraphNode
GraphNode(graph node)

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


(subclass GraphNode GraphElement) Merge.kif 5881-5881 Graph node is a subclass of graph element
(documentation GraphNode EnglishLanguage "Graphs are comprised of GraphNodes and GraphArcs. Every GraphNode is linked by a GraphArc.") Merge.kif 5883-5884 Graph node is a subclass of graph element
(externalImage GraphNode "http://upload.wikimedia.org/wikipedia/commons/ 5/ 5b/ 6n_graf.svg") pictureList.kif 1790-1790 Graph node is a subclass of graph element

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


(partition GraphElement GraphNode GraphArc) Merge.kif 5869-5869 Graph element is exhaustively partitioned into graph node and graph arc
(range InitialNodeFn GraphNode) Merge.kif 5972-5972 The range of initial node is an instance of graph node
(range TerminalNodeFn GraphNode) Merge.kif 5982-5982 The range of terminal node is an instance of graph node
(range BeginNodeFn GraphNode) Merge.kif 5992-5992 The range of begin node is an instance of graph node
(range EndNodeFn GraphNode) Merge.kif 6003-6003 The range of end node is an instance of graph node
(termFormat EnglishLanguage GraphNode "graph node") english_format.kif 1089-1089 The range of end node is an instance of graph node

appearance as argument number 3
-------------------------


(domain links 1 GraphNode) Merge.kif 5922-5922 The number 1 argument of links is an instance of graph node
(domain links 2 GraphNode) Merge.kif 5923-5923 The number 2 argument of links is an instance of graph node
(domain MinimalWeightedPathFn 1 GraphNode) Merge.kif 6059-6059 The number 1 argument of minimal weighted path is an instance of graph node
(domain MinimalWeightedPathFn 2 GraphNode) Merge.kif 6060-6060 The number 2 argument of minimal weighted path is an instance of graph node
(domain MaximalWeightedPathFn 1 GraphNode) Merge.kif 6081-6081 The number 1 argument of maximal weighted path is an instance of graph node
(domain MaximalWeightedPathFn 2 GraphNode) Merge.kif 6082-6082 The number 2 argument of maximal weighted path is an instance of graph node
(domain GraphPathFn 1 GraphNode) Merge.kif 6103-6103 The number 1 argument of graph path is an instance of graph node
(domain GraphPathFn 2 GraphNode) Merge.kif 6104-6104 The number 2 argument of graph path is an instance of graph node

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


(=>
    (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 5679-5699 If All of the following hold: (1) X is an instance of graph (2) Y is an instance of graph node (3) Z is an instance of graph node (4) Y is a part of X (5) Z is a part of X (6) equal Y and Z, then All of the following hold: (1) there exist W (2) V such that W links Y (3) Z, V is a subgraph of X (4) V is an instance of graph path (5) equal the beginning of V (6) Y (7) equal the end of V (8) Z, or equal the beginning of V (9) Z (10) equal the end of V (11) Y
(=>
    (instance ?NODE GraphNode)
    (exists (?OTHER ?ARC)
        (links ?NODE ?OTHER ?ARC)))
Merge.kif 5886-5889 If X is an instance of graph node, then there exist Y, Z such that Z links X, and Y
(=>
    (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 6214-6225 If All of the following hold: (1) X is the unit in Y (2) Z is an instance of graph node (3) Z is a part of Y (4) W is a part of Y (5) W is an instance of graph arc (6) the abstract counterpart of V is Z (7) the abstract counterpart of U is W (8) the value of W is T, then the measure of U is T X(s)

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


(=>
    (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 3965-3975 If X is an instance of transit system, Y is an instance of transitway junction, the abstract counterpart of X is Z, and X is a system part of Y, then there exists W such that W is an instance of graph node, the abstract counterpart of Y is W, and W is a part of Z


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