PathWeightFn - Sigma Knowledge base Browser

Browsing Interface : Welcome guest : log in

[ Home | Graph | ] KB: Language:
Formal Language:

KB Term:			Term intersection

English Word:

Sigma KEE - PathWeightFn

PathWeightFn

appearance as argument number 1

(documentation PathWeightFn ChineseLanguage "这是一个 UnaryFunction，它把一个 GraphPath 联系到在这条 GraphPath GraphArcs 上的 arcWeight 总和。")	chinese_format.kif 2370-2371
(documentation PathWeightFn EnglishLanguage "A UnaryFunction that maps a GraphPath to the sum of the arcWeights on the GraphArcs in the GraphPath.")	Merge.kif 5655-5657
(domain PathWeightFn 1 GraphPath)	Merge.kif 5652-5652	The number 1 argument of path weight is an instance of graph path
(instance PathWeightFn UnaryFunction)	Merge.kif 5651-5651	Path weight is an instance of unary function
(range PathWeightFn Quantity)	Merge.kif 5653-5653	The range of path weight is an instance of quantity

appearance as argument number 2

(format ChineseLanguage PathWeightFn "%1 的值")	chinese_format.kif 769-769
(format EnglishLanguage PathWeightFn "the value of %1")	english_format.kif 772-772
(termFormat ChineseLanguage PathWeightFn "路径衡量函数")	chinese_format.kif 770-770
(termFormat ChineseLanguage PathWeightFn "路径重量")	domainEnglishFormat.kif 44704-44704
(termFormat ChineseTraditionalLanguage PathWeightFn "路徑重量")	domainEnglishFormat.kif 44703-44703
(termFormat EnglishLanguage PathWeightFn "path weight")	domainEnglishFormat.kif 44702-44702

antecedent

(=> (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 5727-5736	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 quantity, then for all the graph path2 if 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 quantity, then the other quantity is less than or equal to the quantity
(=> (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 5702-5711	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 quantity, then for all the graph path2 if 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 quantity, then the other quantity is greater than or equal to the quantity
(=> (and (equal (PathWeightFn ?PATH) ?SUM) (graphPart ?ARC1 ?PATH) (graphPart ?ARC2 ?PATH) (arcWeight ?ARC1 ?NUMBER1) (arcWeight ?ARC2 ?NUMBER2) (forall (?ARC3) (=> (graphPart ?ARC3 ?PATH) (or (equal ?ARC3 ?ARC1) (equal ?ARC3 ?ARC2))))) (equal (PathWeightFn ?PATH) (AdditionFn ?NUMBER1 ?NUMBER2)))	Merge.kif 5673-5686	If the value of a graph path is equal to a quantity and a graph arc is a part of the graph path and another graph arc is a part of the graph path and the value of the graph arc is another quantity and the value of the other graph arc is a third quantity and for all a graph element if the graph element is a part of the graph path, then the graph element is equal to the graph arc or the graph element is equal to the other graph arc , then the value of the graph path is equal to (the other quantity and the third quantity)
(=> (and (equal (PathWeightFn ?PATH) ?SUM) (subGraph ?SUBPATH ?PATH) (graphPart ?ARC1 ?PATH) (arcWeight ?ARC1 ?NUMBER1) (forall (?ARC2) (=> (graphPart ?ARC2 ?PATH) (or (graphPart ?ARC2 ?SUBPATH) (equal ?ARC2 ?ARC1))))) (equal ?SUM (AdditionFn (PathWeightFn ?SUBPATH) ?NUMBER1)))	Merge.kif 5659-5671	If the value of a graph path is equal to a quantity and another graph path is a subgraph of the graph path and a graph arc is a part of the graph path and the value of the graph arc is another quantity and for all a graph element if the graph element is a part of the graph path, then the graph element is a part of the other graph path or the graph element is equal to the graph arc , then the quantity is equal to (the value of the other graph path and the other quantity)

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 5727-5736	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 quantity, then for all the graph path2 if 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 quantity, then the other quantity is less than or equal to the quantity
(=> (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 5702-5711	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 quantity, then for all the graph path2 if 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 quantity, then the other quantity is greater than or equal to the quantity
(=> (and (equal (PathWeightFn ?PATH) ?SUM) (graphPart ?ARC1 ?PATH) (graphPart ?ARC2 ?PATH) (arcWeight ?ARC1 ?NUMBER1) (arcWeight ?ARC2 ?NUMBER2) (forall (?ARC3) (=> (graphPart ?ARC3 ?PATH) (or (equal ?ARC3 ?ARC1) (equal ?ARC3 ?ARC2))))) (equal (PathWeightFn ?PATH) (AdditionFn ?NUMBER1 ?NUMBER2)))	Merge.kif 5673-5686	If the value of a graph path is equal to a quantity and a graph arc is a part of the graph path and another graph arc is a part of the graph path and the value of the graph arc is another quantity and the value of the other graph arc is a third quantity and for all a graph element if the graph element is a part of the graph path, then the graph element is equal to the graph arc or the graph element is equal to the other graph arc , then the value of the graph path is equal to (the other quantity and the third quantity)
(=> (and (equal (PathWeightFn ?PATH) ?SUM) (subGraph ?SUBPATH ?PATH) (graphPart ?ARC1 ?PATH) (arcWeight ?ARC1 ?NUMBER1) (forall (?ARC2) (=> (graphPart ?ARC2 ?PATH) (or (graphPart ?ARC2 ?SUBPATH) (equal ?ARC2 ?ARC1))))) (equal ?SUM (AdditionFn (PathWeightFn ?SUBPATH) ?NUMBER1)))	Merge.kif 5659-5671	If the value of a graph path is equal to a quantity and another graph path is a subgraph of the graph path and a graph arc is a part of the graph path and the value of the graph arc is another quantity and for all a graph element if the graph element is a part of the graph path, then the graph element is a part of the other graph path or the graph element is equal to the graph arc , then the quantity is equal to (the value of the other graph path and the other quantity)

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