maximal weighted path fn (MaximalWeightedPathFn)
This BinaryFunction assigns two
GraphNodes to the GraphPath with the largest sum of weighted arcs
between the two GraphNodes.
Ontology
SUMO / GRAPH-THEORYClass(es)
Coordinate term(s)
addition fn
day fn
density fn
division fn
edition fn
exponentiation fn
graph path fn
hour fn
intersection fn
interval fn
kappa fn
list concatenate fn
list order fn
log fn
max fn
measure fn
mereological difference fn
mereological product fn
mereological sum fn
min fn
minimal weighted path fn
minute fn
month fn
multiplication fn
periodical issue fn
recurrent time interval fn
relative complement fn
relative time fn
remainder fn
second fn
series volume fn
speed fn
subtraction fn
temporal composition fn
time interval fn
union fn
where fn
Type restrictions
CamminoDelGrafo MaximalWeightedPathFn(NodoDelGrafo, NodoDelGrafo)
Axioms (2)
Se "il il cammino col costo maggiore tra node1 e node2" is uguale a path, allora path é un' istanza di "l' insieme di cammini tra node1 e node2".
(=>
(equal
(MaximalWeightedPathFn ?NODE1 ?NODE2)
?PATH)
(instance
?PATH
(GraphPathFn ?NODE1 ?NODE2)))
- se "il il cammino col costo maggiore tra node1 e node2" is uguale a path e "il valore di path" is uguale a number,
- allora per ogni path2 vale: se path2 é un' istanza di "l' insieme di cammini tra node1 e node2" e "il valore di path2" is uguale a number2, allora number2 é minore o uguale a number1
.
(=>
(and
(equal
(MaximalWeightedPathFn ?NODE1 ?NODE2)
?PATH)
(equal
(PathWeightFn ?PATH)
?NUMBER))
(forall
(?PATH2)
(=>
(and
(instance
?PATH2
(GraphPathFn ?NODE1 ?NODE2))
(equal
(PathWeightFn ?PATH2)
?NUMBER2))
(lessThanOrEqualTo ?NUMBER2 ?NUMBER1))))