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

Formal Language: 



KB Term:  Term intersection
English Word: 

  GraphPathFn

Sigma KEE - GraphPathFn
GraphPathFn

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


(documentation GraphPathFn ChineseLanguage "这是一个 BinaryFunction,它把两个GraphNode 联系到这两个节点之间的 GraphPath Class。注:这两个 GraphNode 必须属于同一个 Graph。") chinese_format.kif 2376-2377
(documentation GraphPathFn EnglishLanguage "A BinaryFunction that maps two GraphNodes to the Class of GraphPaths between those two nodes. Note that the two GraphNodes must belong to the same Graph.") Merge.kif 5989-5991
(domain GraphPathFn 1 GraphNode) Merge.kif 5985-5985
(domain GraphPathFn 2 GraphNode) Merge.kif 5986-5986
(instance GraphPathFn BinaryFunction) Merge.kif 5983-5983
(instance GraphPathFn TotalValuedRelation) Merge.kif 5984-5984
(rangeSubclass GraphPathFn GraphPath) Merge.kif 5987-5987

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


(format ChineseLanguage GraphPathFn "%1 和 %2 的路径集 Set") chinese_format.kif 775-775
(format EnglishLanguage GraphPathFn "the set of paths between %1 and %2") english_format.kif 775-775
(termFormat ChineseLanguage GraphPathFn "图形路径") domainEnglishFormat.kif 26456-26456
(termFormat ChineseLanguage GraphPathFn "图路函数") chinese_format.kif 776-776
(termFormat ChineseTraditionalLanguage GraphPathFn "圖形路徑") domainEnglishFormat.kif 26455-26455
(termFormat EnglishLanguage GraphPathFn "graph path") domainEnglishFormat.kif 26454-26454

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


(=>
    (and
        (equal
            (MaximalWeightedPathFn ?NODE1 ?NODE2) ?PATH)
        (equal
            (PathWeightFn ?PATH) ?NUMBER1))
    (forall (?PATH2)
        (=>
            (and
                (instance ?PATH2
                    (GraphPathFn ?NODE1 ?NODE2))
                (equal
                    (PathWeightFn ?PATH2) ?NUMBER2))
            (lessThanOrEqualTo ?NUMBER2 ?NUMBER1))))
Merge.kif 5972-5981
(=>
    (and
        (equal
            (MinimalWeightedPathFn ?NODE1 ?NODE2) ?PATH)
        (equal
            (PathWeightFn ?PATH) ?NUMBER1))
    (forall (?PATH2)
        (=>
            (and
                (instance ?PATH2
                    (GraphPathFn ?NODE1 ?NODE2))
                (equal
                    (PathWeightFn ?PATH2) ?NUMBER2))
            (greaterThanOrEqualTo ?NUMBER2 ?NUMBER1))))
Merge.kif 5947-5956
(=>
    (and
        (graphPart ?PATH ?GRAPH)
        (not
            (instance ?GRAPH DirectedGraph)))
    (<=>
        (instance ?PATH
            (GraphPathFn ?NODE1 ?NODE2))
        (instance ?PATH
            (GraphPathFn ?NODE2 ?NODE1))))
Merge.kif 5993-5999
(=>
    (equal
        (MaximalWeightedPathFn ?NODE1 ?NODE2) ?PATH)
    (instance ?PATH
        (GraphPathFn ?NODE1 ?NODE2)))
Merge.kif 5968-5970
(=>
    (equal
        (MinimalWeightedPathFn ?NODE1 ?NODE2) ?PATH)
    (instance ?PATH
        (GraphPathFn ?NODE1 ?NODE2)))
Merge.kif 5943-5945


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