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


KB Term:  Term intersection
English Word: 

  GraphArc

 Sigma KEE - GraphArc
GraphArc(graph arc)
asymptote, center_line, centerline, chord, connection, connexion, diagonal, diameter, element, element_of_a_cone, element_of_a_cylinder, geodesic, geodesic_line, link, perimeter, perpendicular, radius, ray, secant, straight_line, vector

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


(subclass GraphArc GraphElement) Merge.kif 5962-5962 Graph arc is a subclass of graph element
(documentation GraphArc EnglishLanguage "Graphs are comprised of GraphNodes and GraphArcs. Every GraphArc links two GraphNodes.") Merge.kif 5964-5965 Graph arc is a subclass of graph element
(externalImage GraphArc "http://upload.wikimedia.org/wikipedia/commons/5/ 5b/ 6n_graf.svg") pictureList.kif 1787-1787 Graph arc is a subclass of graph element

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


(subclass GraphLoop GraphArc) Merge.kif 5972-5972 Graph loop is a subclass of graph arc
(termFormat EnglishLanguage GraphArc "graph arc") english_format.kif 1095-1095 Graph loop is a subclass of graph arc

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


(partition GraphElement GraphNode GraphArc) Merge.kif 5940-5940 Graph element is exhaustively partitioned into graph node and graph arc
(domain links 3 GraphArc) Merge.kif 5995-5995 The number 3 argument of links is an instance of graph arc
(domain InitialNodeFn 1 GraphArc) Merge.kif 6041-6041 The number 1 argument of initial node is an instance of graph arc
(domain TerminalNodeFn 1 GraphArc) Merge.kif 6051-6051 The number 1 argument of terminal node is an instance of graph arc
(domain arcWeight 1 GraphArc) Merge.kif 6083-6083 The number 1 argument of arc weight is an instance of graph arc

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


(=>
    (and
        (instance ?GRAPH DirectedGraph)
        (instance ?ARC GraphArc)
        (graphPart ?ARC ?GRAPH))
    (exists (?NODE1 ?NODE2)
        (and
            (equal
                (InitialNodeFn ?ARC) ?NODE1)
            (equal
                (TerminalNodeFn ?ARC) ?NODE2))))		 Merge.kif 5795-5803 If X is an instance of directed graph, Y is an instance of graph arc, and Y is a part of X, then there exist Z, W such that equal the starting node of Y, Z, equal the terminal node of Y, and W
(=>
    (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 5846-5857 If X is an instance of graph path, Y is an instance of graph arc, Y is a part of X, and equal the starting node of Y and Z, then there doesn't exist W such that equal the starting node of W, Z, equal W, and Y
(=>
    (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 5859-5870 If X is an instance of graph path, Y is an instance of graph arc, Y is a part of X, and equal the terminal node of Y and Z, then there doesn't exist W such that equal the terminal node of W, Z, equal W, and Y
(=>
    (instance ?ARC GraphArc)
    (exists (?NODE1 ?NODE2)
        (links ?NODE1 ?NODE2 ?ARC)))		 Merge.kif 5967-5970 If X is an instance of graph arc, then there exist Y, Z such that X links Y, and Z
(=>
    (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 6284-6295 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 ?T Transitway)
        (abstractCounterpart ?G ?TS)
        (systemPart ?T ?TS))
    (exists (?GA)
        (and
            (instance ?GA GraphArc)
            (abstractCounterpart ?GA ?T)
            (graphPart ?GA ?G))))		 Transportation.kif 3987-3997 If X is an instance of transit system, Y is an instance of transitway, 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 arc, the abstract counterpart of Y is W, and W is a part of Z


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.0-0a80e6c8 (2026-05-12) is open source software produced by Articulate Software and its partners