TreeView Knowledge Base Browser - GraphPathFn

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 6059-6061
(documentation GraphPathFn JapaneseLanguage "BinaryFunctionは、2つの GraphNode をこれらの2つのノード間の GraphPath の Class にマップする。注：2つの GraphNode は同じ Graph に属している必要がある。")	japanese_format.kif 1053-1055
(domain GraphPathFn 1 GraphNode)	Merge.kif 6055-6055	The number 1 argument of graph path is an instance of graph node
(domain GraphPathFn 2 GraphNode)	Merge.kif 6056-6056	The number 2 argument of graph path is an instance of graph node
(instance GraphPathFn BinaryFunction)	Merge.kif 6053-6053	Graph path is an instance of binary function
(instance GraphPathFn TotalValuedRelation)	Merge.kif 6054-6054	Graph path is an instance of total valued relation
(rangeSubclass GraphPathFn GraphPath)	Merge.kif 6057-6057	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 26466-26466
(termFormat ChineseLanguage GraphPathFn "图路函数")	chinese_format.kif 776-776
(termFormat ChineseTraditionalLanguage GraphPathFn "圖形路徑")	domainEnglishFormat.kif 26465-26465
(termFormat EnglishLanguage GraphPathFn "graph path")	domainEnglishFormat.kif 26464-26464

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 6045-6051	If the highest cost path between a graph node and another graph node is equal to a graph path and the value of the graph path is equal to a real number and the graph path2 is an instance of the set of paths between the graph node and the other graph node and the value of the graph path2 is equal to another real number, then the other real number is less than or equal to the real number
(=> (and (equal (MinimalWeightedPathFn ?NODE1 ?NODE2) ?PATH) (equal (PathWeightFn ?PATH) ?NUMBER1) (instance ?PATH2 (GraphPathFn ?NODE1 ?NODE2)) (equal (PathWeightFn ?PATH2) ?NUMBER2)) (greaterThanOrEqualTo ?NUMBER2 ?NUMBER1))	Merge.kif 6023-6029	If the lowest cost path between a graph node and another graph node is equal to a graph path and the value of the graph path is equal to a real number and the graph path2 is an instance of the set of paths between the graph node and the other graph node and the value of the graph path2 is equal to another real number, then the other real number is greater than or equal to the real number

consequent

(=> (and (graphPart ?PATH ?GRAPH) (not (instance ?GRAPH DirectedGraph))) (<=> (instance ?PATH (GraphPathFn ?NODE1 ?NODE2)) (instance ?PATH (GraphPathFn ?NODE2 ?NODE1))))	Merge.kif 6063-6069	If a graph element is a part of a graph and the graph is not an instance of directed graph, then the graph element is an instance of the set of paths between a graph node and another graph node if and only if the graph element is an instance of the set of paths between the other graph node and the graph node
(=> (equal (MaximalWeightedPathFn ?NODE1 ?NODE2) ?PATH) (instance ?PATH (GraphPathFn ?NODE1 ?NODE2)))	Merge.kif 6041-6043	If the highest cost path between a graph node and another graph node is equal to a graph path, then the graph path is an instance of the set of paths between the graph node and the other graph node
(=> (equal (MinimalWeightedPathFn ?NODE1 ?NODE2) ?PATH) (instance ?PATH (GraphPathFn ?NODE1 ?NODE2)))	Merge.kif 6019-6021	If the lowest cost path between a graph node and another graph node is equal to a graph path, then the graph path is an instance of the set of paths between the graph node and the other graph node

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