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


KB Term:  Term intersection
English Word: 

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 6108-6110
(documentation GraphPathFn JapaneseLanguage "BinaryFunctionは、2つの GraphNode をこれ らの2つのノード間の GraphPath の Class にマップする。 注：2つの GraphNode は同じ Graph に属している必要がある。") japanese_format.kif 1053-1055
(domain GraphPathFn 1 GraphNode) Merge.kif 6104-6104 The number 1 argument of graph path is an instance of graph node
(domain GraphPathFn 2 GraphNode) Merge.kif 6105-6105 The number 2 argument of graph path is an instance of graph node
(instance GraphPathFn BinaryFunction) Merge.kif 6102-6102 Graph path is an instance of binary function
(instance GraphPathFn TotalValuedRelation) Merge.kif 6103-6103 Graph path is an instance of total valued relation
(rangeSubclass GraphPathFn GraphPath) Merge.kif 6106-6106 The values returned by graph path are subclasses of graph path

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
(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 JapaneseLanguage GraphPathFn "%1 と %2 間のパスの set") japanese_format.kif 2171-2171
(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 ro GraphPathFn "set%t{mulþimea} drumurilor între %1 ºi %2") relations-ro.kif 489-489
(format sv GraphPathFn "mängden av vägar mellan %1 och %2") relations-sv.txt 537-537
(format tg GraphPathFn "ang pangkat sa landas sa gitnang %1 at %2") relations-tg.txt 247-247
(termFormat ChineseLanguage GraphPathFn "图形路径") domainEnglishFormat.kif 26476-26476
(termFormat ChineseLanguage GraphPathFn "图路函数") chinese_format.kif 776-776
(termFormat ChineseTraditionalLanguage GraphPathFn "圖形路徑") domainEnglishFormat.kif 26475-26475
(termFormat EnglishLanguage GraphPathFn "graph path") domainEnglishFormat.kif 26474-26474
(termFormat de GraphPathFn "GraphPfadFn") terms-de.txt 307-307

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


(=>
    (and
        (equal
            (MaximalWeightedPathFn ?NODE1 ?NODE2) ?PATH)
        (equal
            (PathWeightFn ?PATH) ?NUMBER1)
        (instance ?PATH2
            (GraphPathFn ?NODE1 ?NODE2))
        (equal
            (PathWeightFn ?PATH2) ?NUMBER2))
    (lessThanOrEqualTo ?NUMBER2 ?NUMBER1))		 Merge.kif 6094-6100
(=>
    (and
        (equal
            (MinimalWeightedPathFn ?NODE1 ?NODE2) ?PATH)
        (equal
            (PathWeightFn ?PATH) ?NUMBER1)
        (instance ?PATH2
            (GraphPathFn ?NODE1 ?NODE2))
        (equal
            (PathWeightFn ?PATH2) ?NUMBER2))
    (greaterThanOrEqualTo ?NUMBER2 ?NUMBER1))		 Merge.kif 6072-6078

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


(=>
    (and
        (graphPart ?PATH ?GRAPH)
        (not
            (instance ?GRAPH DirectedGraph)))
    (<=>
        (instance ?PATH
            (GraphPathFn ?NODE1 ?NODE2))
        (instance ?PATH
            (GraphPathFn ?NODE2 ?NODE1))))		 Merge.kif 6112-6118
(=>
    (equal
        (MaximalWeightedPathFn ?NODE1 ?NODE2) ?PATH)
    (instance ?PATH
        (GraphPathFn ?NODE1 ?NODE2)))		 Merge.kif 6090-6092
(=>
    (equal
        (MinimalWeightedPathFn ?NODE1 ?NODE2) ?PATH)
    (instance ?PATH
        (GraphPathFn ?NODE1 ?NODE2)))		 Merge.kif 6068-6070


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