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

Formal Language: 



KB Term:  Term intersection
English Word: 

Sigma KEE - GraphPath
GraphPath(graph path)axis, coordinate_axis, dimension, major_axis, major_lobe, minor_axis, optic_axis, principal_axis, semimajor_axis, semiminor_axis, x-axis, y-axis, z-axis

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


(documentation GraphPath ChineseLanguage "非形式来说,这是一个 Graph 的两个 GraphNode 之间 的单一有向的路径。形式的说,这是一个 DirectedGraph,它是原来的 GraphsubGraph,而使得 这个 DirectedGraph 里没有两个 GraphArc 有着相同的始点(可参考 InitialNodeFn) 或相同的终点 (可参考 TerminalNodeFn)。") chinese_format.kif 2330-2333
(documentation GraphPath EnglishLanguage "Informally, a single, directed route between two GraphNodes in a Graph. Formally, a DirectedGraph that is a subGraph of the original Graph and such that no two GraphArcs in the DirectedGraph have the same initial node (see InitialNodeFn) or the same terminal node (see TerminalNodeFn).") Merge.kif 5651-5655
(subclass GraphPath DirectedGraph) Merge.kif 5649-5649 Graph path is a subclass of directed graph

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


(range MaximalWeightedPathFn GraphPath) Merge.kif 5969-5969 The range of maximal weighted path is an instance of graph path
(range MinimalWeightedPathFn GraphPath) Merge.kif 5943-5943 The range of minimal weighted path is an instance of graph path
(rangeSubclass CutSetFn GraphPath) Merge.kif 6011-6011 The values returned by cut set are subclasses of graph path
(rangeSubclass GraphPathFn GraphPath) Merge.kif 5995-5995 The values returned by graph path are subclasses of graph path
(rangeSubclass MinimalCutSetFn GraphPath) Merge.kif 6019-6019 The values returned by minimal cut set are subclasses of graph path
(subclass GraphCircuit GraphPath) Merge.kif 5683-5683 Graph circuit is a subclass of graph path
(termFormat ChineseLanguage GraphPath "图路径") chinese_format.kif 936-936
(termFormat EnglishLanguage GraphPath "graph path") english_format.kif 1079-1079

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


(domain BeginNodeFn 1 GraphPath) Merge.kif 5873-5873 The number 1 argument of begin node is an instance of graph path
(domain EndNodeFn 1 GraphPath) Merge.kif 5884-5884 The number 1 argument of end node is an instance of graph path
(domain PathWeightFn 1 GraphPath) Merge.kif 5903-5903 The number 1 argument of path weight is an instance of graph path
(domain pathLength 1 GraphPath) Merge.kif 5843-5843 The number 1 argument of path length is an instance of graph path

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


(=>
    (and
        (instance ?GRAPH GraphPath)
        (instance ?ARC GraphArc)
        (graphPart ?ARC ?GRAPH))
    (=>
        (exists (?NODE)
            (equal
                (InitialNodeFn ?ARC) ?NODE))
        (not
            (exists (?OTHER)
                (and
                    (equal
                        (InitialNodeFn ?OTHER) ?NODE)
                    (not
                        (equal ?OTHER ?ARC)))))))
Merge.kif 5657-5668
(=>
    (and
        (instance ?GRAPH GraphPath)
        (instance ?ARC GraphArc)
        (graphPart ?ARC ?GRAPH))
    (=>
        (exists (?NODE)
            (equal
                (TerminalNodeFn ?ARC) ?NODE))
        (not
            (exists (?OTHER)
                (and
                    (equal
                        (TerminalNodeFn ?OTHER) ?NODE)
                    (not
                        (equal ?OTHER ?ARC)))))))
Merge.kif 5670-5681

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


(=>
    (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 5561-5581
(=>
    (distanceOnPath ?DIST ?PATH)
    (exists (?GP)
        (and
            (instance ?GP GraphPath)
            (abstractCounterpart ?GP ?PATH))))
Transportation.kif 2799-2804


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