Browsing Interface
: Welcome guest :
log in
[
Home
|
Graph
| ]
KB:
SUMO
Language:
ChineseLanguage
ChinesePinyinWriting
ChineseSimplifiedWriting
ChineseTraditionalLanguage
EnglishLanguage
FrenchLanguage
GermanLanguage
Hindi
ItalianLanguage
JapaneseLanguage
PortugueseLanguage
SpanishLanguage
SwedishLanguage
cb
cz
de
format
hi
ro
sv
tg
Formal Language:
OWL
SUO-KIF
TPTP
traditionalLogic
KB Term:
Term intersection
English Word:
Any
Noun
Verb
Adjective
Adverb
PathWeightFn
Sigma KEE - PathWeightFn
PathWeightFn
appearance as argument number 1
(
documentation
PathWeightFn
ChineseLanguage
"这是一个
UnaryFunction
， 它把一个
GraphPath
联系到在这条
GraphPath
GraphArc
s 上的
arcWeight
总和。")
chinese_format.kif 2370-2371
(
documentation
PathWeightFn
EnglishLanguage
"A
UnaryFunction
that maps a
GraphPath
to the sum of the
arcWeight
s on the
GraphArc
s in the
GraphPath
.")
Merge.kif 6025-6027
(
documentation
PathWeightFn
JapaneseLanguage
"
UnaryFunction
は、
GraphPath
を
GraphPath
内にある
GraphArc
s 上の
arcWeight
s の合計にマップする。")
japanese_format.kif 1047-1048
(
domain
PathWeightFn
1
GraphPath
)
Merge.kif 6022-6022
The number 1 argument of
PathWeightFn
is an
instance
of
graph path
(
instance
PathWeightFn
UnaryFunction
)
Merge.kif 6021-6021
PathWeightFn
is an
instance
of
unary function
(
range
PathWeightFn
RealNumber
)
Merge.kif 6023-6023
The
range
of
PathWeightFn
is an instance of
real number
appearance as argument number 2
(
format
ChineseLanguage
PathWeightFn
"%1 的值")
chinese_format.kif 769-769
(
format
EnglishLanguage
PathWeightFn
"the value of %1")
english_format.kif 769-769
(
format
FrenchLanguage
PathWeightFn
"la valeur de %1")
french_format.kif 464-464
(
format
ItalianLanguage
PathWeightFn
"il valore di %1")
relations-it.txt 218-218
(
format
JapaneseLanguage
PathWeightFn
"%1 の value")
japanese_format.kif 2168-2168
(
format
PortugueseLanguage
PathWeightFn
"o valor de %1")
portuguese_format.kif 416-416
(
format
de
PathWeightFn
"der wert von %1")
relations-de.txt 994-994
(
format
hi
PathWeightFn
"%1 kaa maana")
relations-hindi.txt 256-256
(
format
ro
PathWeightFn
"value%t{valoarea} lui %1")
relations-ro.kif 486-486
(
format
sv
PathWeightFn
"värdet av %1")
relations-sv.txt 532-532
(
format
tg
PathWeightFn
"ang bale ng %1")
relations-tg.txt 410-410
(
termFormat
ChineseLanguage
PathWeightFn
"路径衡量函数")
chinese_format.kif 770-770
(
termFormat
ChineseLanguage
PathWeightFn
"路径重量")
domainEnglishFormat.kif 44791-44791
(
termFormat
ChineseTraditionalLanguage
PathWeightFn
"路徑重量")
domainEnglishFormat.kif 44790-44790
(
termFormat
EnglishLanguage
PathWeightFn
"path weight")
domainEnglishFormat.kif 44789-44789
(
termFormat
de
PathWeightFn
"PfadGewichtfn")
terms-de.txt 304-304
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
If
equal
the
highest
cost
path
between
a graph node
and
another graph node
and
a graph path
and
equal
the
value
of
the graph path
and
a real number
and
the graph path
2 is an
instance
of the
set
of paths between
the graph node
and
the other graph node
and
equal
the
value
of
the graph path
2 and
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 6072-6078
If
equal
the
lowest
cost
path
between
a graph node
and
another graph node
and
a graph path
and
equal
the
value
of
the graph path
and
a real number
and
the graph path
2 is an
instance
of the
set
of paths between
the graph node
and
the other graph node
and
equal
the
value
of
the graph path
2 and
another real number
,
then
the other real number
is
greater
than or equal to
the real number
(=>
(
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 6043-6056
If
equal
the
value
of
a graph path
and
a real number
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 real number
and the
value
of
the other graph arc
is
a third real number
and for all
a graph element
if
the graph element
is a
part
of
the graph path
,
then
equal
the graph element
and
the graph arc
or
equal
the graph element
and
the other graph arc
,
then
equal
the
value
of
the graph path
and (
the other real number
and
the third real number
)
(=>
(
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 6029-6041
If
equal
the
value
of
a graph path
and
an integer
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
a real number
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
equal
the graph element
and
the graph arc
,
then
equal
the integer
and (the
value
of
the other graph path
and
the real number
)
consequent
(=>
(
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 6043-6056
If
equal
the
value
of
a graph path
and
a real number
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 real number
and the
value
of
the other graph arc
is
a third real number
and for all
a graph element
if
the graph element
is a
part
of
the graph path
,
then
equal
the graph element
and
the graph arc
or
equal
the graph element
and
the other graph arc
,
then
equal
the
value
of
the graph path
and (
the other real number
and
the third real number
)
(=>
(
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 6029-6041
If
equal
the
value
of
a graph path
and
an integer
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
a real number
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
equal
the graph element
and
the graph arc
,
then
equal
the integer
and (the
value
of
the other graph path
and
the real number
)
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
