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

Formal Language: 



KB Term:  Term intersection
English Word: 

Sigma KEE - GraphPath
GraphPath

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 5445-5449
(subclass GraphPath DirectedGraph) Merge.kif 5443-5443

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


(range MaximalWeightedPathFn GraphPath) Merge.kif 5734-5734
(range MinimalWeightedPathFn GraphPath) Merge.kif 5709-5709
(rangeSubclass CutSetFn GraphPath) Merge.kif 5775-5775
(rangeSubclass GraphPathFn GraphPath) Merge.kif 5759-5759
(rangeSubclass MinimalCutSetFn GraphPath) Merge.kif 5783-5783
(subclass GraphCircuit GraphPath) Merge.kif 5475-5475
(termFormat ChineseLanguage GraphPath "图路径") chinese_format.kif 936-936
(termFormat EnglishLanguage GraphPath "graph path") english_format.kif 1084-1084

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


(domain BeginNodeFn 1 GraphPath) Merge.kif 5639-5639
(domain EndNodeFn 1 GraphPath) Merge.kif 5650-5650
(domain PathWeightFn 1 GraphPath) Merge.kif 5669-5669
(domain pathLength 1 GraphPath) Merge.kif 5609-5609

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


(=>
    (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 5451-5461
(=>
    (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 5463-5473

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 5355-5375
(=>
    (distanceOnPath ?DIST ?PATH)
    (exists (?GP)
        (and
            (instance ?GP GraphPath)
            (abstractCounterpart ?GP ?PATH))))
Transportation.kif 2806-2811


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