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。") Merge.kif 6175-6176
(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 6172-6174
(domain GraphPathFn 1 GraphNode) Merge.kif 6169-6169
(domain GraphPathFn 2 GraphNode) Merge.kif 6170-6170
(instance GraphPathFn BinaryFunction) Merge.kif 6167-6167
(instance GraphPathFn TotalValuedRelation) Merge.kif 6168-6168
(rangeSubclass GraphPathFn GraphPath) Merge.kif 6171-6171

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 478-478
(format FrenchLanguage GraphPathFn "l' ensemble de chemin entre %1 et %2") french_format.kif 467-467
(format ItalianLanguage GraphPathFn "l' insieme di cammini tra %1 e %2") relations-it.txt 120-120
(format PortugueseLanguage GraphPathFn "o conjunto de caminhos entre %1 e %2") portuguese_format.kif 419-419
(format de GraphPathFn "die menge von Pfaden zwischen %1 und %2") relations-de.txt 1003-1003
(format hi GraphPathFn "%1 aura %2 ke biicha ke pathasamuuha") relations-hindi.txt 160-160
(format tg GraphPathFn "ang pangkat sa landas sa gitnang %1 at %2") relations-tg.txt 247-247
(termFormat ChineseLanguage GraphPathFn "图路函数") chinese_format.kif 776-776
(termFormat EnglishLanguage GraphPathFn "graph path") domainEnglishFormat.kif 4832-4832

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 6156-6165
(=>
    (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 6130-6139
(=>
    (and
        (graphPart ?PATH ?GRAPH)
        (not
            (instance ?GRAPH DirectedGraph)))
    (<=>
        (equal
            (GraphPathFn ?NODE1 ?NODE2) ?PATH)
        (equal
            (GraphPathFn ?NODE2 ?NODE1) ?PATH)))
Merge.kif 6178-6184
(=>
    (equal
        (MaximalWeightedPathFn ?NODE1 ?NODE2) ?PATH)
    (instance ?PATH
        (GraphPathFn ?NODE1 ?NODE2)))
Merge.kif 6152-6154
(=>
    (equal
        (MinimalWeightedPathFn ?NODE1 ?NODE2) ?PATH)
    (instance ?PATH
        (GraphPathFn ?NODE1 ?NODE2)))
Merge.kif 6126-6128


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 2.99c (>= 2017/11/20) is open source software produced by Articulate Software and its partners