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


KB Term:  Term intersection
English Word: 

Sigma KEE - abstractCounterpart
abstractCounterpart

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


(instance abstractCounterpart BinaryPredicate) Merge.kif 6229-6229 abstract counterpart is an instance of binary predicate
(domain abstractCounterpart 1 Abstract) Merge.kif 6230-6230 The number 1 argument of abstract counterpart is an instance of abstract
(domain abstractCounterpart 2 Physical) Merge.kif 6231-6231 The number 2 argument of abstract counterpart is an instance of physical
(subrelation abstractCounterpart represents) Merge.kif 6232-6232 abstract counterpart is a subrelation of represents
(documentation abstractCounterpart EnglishLanguage "(abstractCounterpart ?AB ?PHYS) relates a Physical entity to an Abstract one which is an idealized model in some dimension of the Physical entity. For example, an Abstract GraphNode could be stated to be the counterpart of an actual Computer in a ComputerNetwork.") Merge.kif 6234-6238 abstract counterpart is a subrelation of represents

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


(format EnglishLanguage abstractCounterpart "the abstract counterpart of %2 is %1") domainEnglishFormat.kif 2648-2648
(format ChineseTraditionalLanguage abstractCounterpart "%2 的 abstract counterpart %n 是 %1 ") domainEnglishFormat.kif 2649-2649
(format ChineseLanguage abstractCounterpart "%2 的 abstract counterpart %n 是 %1 ") domainEnglishFormat.kif 2650-2650
(termFormat EnglishLanguage abstractCounterpart "abstract counterpart") domainEnglishFormat.kif 65768-65768

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


(=>
    (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)
(=>
    (and
        (distanceOnPath ?DIST ?PATH)
        (pathInSystem ?PATH ?SYS)
        (routeStart ?START ?PATH)
        (routeEnd ?END ?PATH)
        (abstractCounterpart ?GRAPH ?SYS))
    (exists (?S ?BN ?EN)
        (and
            (subGraph ?S ?GRAPH)
            (equal ?BN
                (BeginNodeFn ?GRAPH))
            (equal ?EN
                (EndNodeFn ?GRAPH))
            (abstractCounterpart ?BN ?START)
            (abstractCounterpart ?EN ?END))))
Transportation.kif 3947-3960 If the distance of X is Y, Z is a path in system of X, W is the start of X, V is the end of X, and the abstract counterpart of Z is U, then All of the following hold: (1) there exist T, S (2) R such that T is a subgraph of U (3) equal S (4) the beginning of U (5) equal R (6) the end of U (7) the abstract counterpart of W is S (8) the abstract counterpart of V is R
(=>
    (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
(=>
    (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 3999-4009 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
(=>
    (and
        (connects ?A ?NODE1 ?NODE2)
        (abstractCounterpart ?N1 ?NODE1)
        (abstractCounterpart ?N2 ?NODE2)
        (abstractCounterpart ?ARC ?A))
    (links ?N1 ?N2 ?ARC))
Transportation.kif 4011-4017 If X connects Y and Z, the abstract counterpart of Y is W, the abstract counterpart of Z is V, and the abstract counterpart of X is U, then U links W and V

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


(=>
    (graphMeasure ?G ?M)
    (forall (?AC)
        (and
            (graphPart ?AC ?G)
            (exists (?PC)
                (abstractCounterpart ?AC ?PC)))))
Merge.kif 6276-6282 If X is the unit in Y, then For all GraphElement Z: Z is a part of Y and there exists W such that the abstract counterpart of W is Z
(=>
    (distanceOnPath ?DIST ?PATH)
    (exists (?GP)
        (and
            (instance ?GP GraphPath)
            (abstractCounterpart ?GP ?PATH))))
Transportation.kif 3940-3945 If the distance of X is Y, then there exists Z such that Z is an instance of graph path and the abstract counterpart of X is Z
(=>
    (and
        (distanceOnPath ?DIST ?PATH)
        (pathInSystem ?PATH ?SYS)
        (routeStart ?START ?PATH)
        (routeEnd ?END ?PATH)
        (abstractCounterpart ?GRAPH ?SYS))
    (exists (?S ?BN ?EN)
        (and
            (subGraph ?S ?GRAPH)
            (equal ?BN
                (BeginNodeFn ?GRAPH))
            (equal ?EN
                (EndNodeFn ?GRAPH))
            (abstractCounterpart ?BN ?START)
            (abstractCounterpart ?EN ?END))))
Transportation.kif 3947-3960 If the distance of X is Y, Z is a path in system of X, W is the start of X, V is the end of X, and the abstract counterpart of Z is U, then All of the following hold: (1) there exist T, S (2) R such that T is a subgraph of U (3) equal S (4) the beginning of U (5) equal R (6) the end of U (7) the abstract counterpart of W is S (8) the abstract counterpart of V is R
(=>
    (instance ?TS TransitSystem)
    (exists (?G)
        (and
            (instance ?G Graph)
            (abstractCounterpart ?G ?TS))))
Transportation.kif 3980-3985 If X is an instance of transit system, then there exists Y such that Y is an instance of graph and the abstract counterpart of X is Y
(=>
    (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
(=>
    (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 3999-4009 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.0-ac69cf7a (2026-05-13) is open source software produced by Articulate Software and its partners