Browsing Interface
: Welcome guest :
log in
[
Home
| 
Graph
|  ]
KB:
SUMO
Language:
ChineseLanguage
ChinesePinyinWriting
ChineseSimplifiedWriting
ChineseTraditionalLanguage
EnglishLanguage
FrenchLanguage
GermanLanguage
HerbaceousPlant
Hindi
ItalianLanguage
JapaneseLanguage
PortugueseLanguage
SpanishLanguage
SwedishLanguage
WoodyPlant
cb
cz
de
hi
ro
sv
tg
Formal Language:
OWL
SUO-KIF
TPTP
traditionalLogic
KB Term:
Term intersection
English Word:
Any
Noun
Verb
Adjective
Adverb
pathLength
Sigma KEE - pathLength
pathLength
appearance as argument number 1
(
documentation
pathLength
ChineseLanguage
"这是一个
BinaryPredicate
,它指定一个
GraphPath
的长度 (以
GraphNode
以的数量),(
pathLength
?PATH ?NUMBER)的意思是在
GraphPath
?PATH 上有 ?NUMBER 的节点。")
chinese_format.kif 2353-2355
(
documentation
pathLength
EnglishLanguage
"A
BinaryPredicate
that specifies the length (in number of
GraphNode
s) of a
GraphPath
. (
pathLength
?PATH ?NUMBER) means that there are ?NUMBER nodes in the
GraphPath
?PATH.")
Merge.kif 5916-5919
(
documentation
pathLength
JapaneseLanguage
"
BinaryPredicate
は、
GraphPath
の長さ (
GraphNode
s 数で) を指定する。 (
pathLength
?PATH ?NUMBER)とは、
GraphPath
?PATH に ?NUMBER ノードがあることを意味する。")
japanese_format.kif 1030-1032
(
domain
pathLength
1
GraphPath
)
Merge.kif 5913-5913
The number 1 argument of
path length
is an
instance
of
graph path
(
domain
pathLength
2
PositiveInteger
)
Merge.kif 5914-5914
The number 2 argument of
path length
is an
instance
of
positive integer
(
instance
pathLength
BinaryPredicate
)
Merge.kif 5912-5912
path length
is an
instance
of
binary predicate
appearance as argument number 2
(
format
ChineseLanguage
pathLength
"%1 的
length
%n 是 %2")
chinese_format.kif 753-753
(
format
EnglishLanguage
pathLength
"the
length
of %1 is %n %2")
english_format.kif 755-755
(
format
FrenchLanguage
pathLength
"la longueur de %1 est %n %2")
french_format.kif 454-454
(
format
ItalianLanguage
pathLength
"la lunghezza di %1 è %n %2")
relations-it.txt 217-217
(
format
JapaneseLanguage
pathLength
"%1 の
length
は %2 では %n")
japanese_format.kif 2162-2162
(
format
PortugueseLanguage
pathLength
"o comprimento de %1 e' %n %2")
portuguese_format.kif 406-406
(
format
cz
pathLength
"d�lka %1 %p{je} %n{nen�} %2")
relations-cz.txt 467-467
(
format
de
pathLength
"die laenge von %1 ist %2 %n{nicht}")
relations-de.txt 972-972
(
format
hi
pathLength
"%1 kii lambaaii %2 %n hai")
relations-hindi.txt 255-255
(
format
ro
pathLength
"
length
%t{lungimea} lui %1 %n{nu} este %2")
relations-ro.kif 476-476
(
format
sv
pathLength
"längden av %1 är %n{inte} %2")
relations-sv.txt 519-519
(
format
tg
pathLength
"ang haba ng %1 %n ay %2")
relations-tg.txt 409-409
(
termFormat
ChineseLanguage
pathLength
"路径长度")
chinese_format.kif 754-754
(
termFormat
ChineseTraditionalLanguage
pathLength
"路徑長度")
domainEnglishFormat.kif 44785-44785
(
termFormat
EnglishLanguage
pathLength
"path length")
domainEnglishFormat.kif 44784-44784
consequent
(=>
(
equal
(
MinimalCutSetFn
?GRAPH) ?PATHCLASS)
(
exists
(?NUMBER)
(
forall
(?PATH)
(=>
(
instance
?PATH ?PATHCLASS)
(
pathLength
?PATH ?NUMBER)))))
Merge.kif 6092-6098
If the
set
of minimal paths that partition
a graph
into two separate graphs is
equal
to
a kind of graph path
,
then there exists
a positive integer
such that for all
another graph path
if
the other graph path
is an
instance
of
a kind of graph path
,
then the
length
of
the other graph path
is
the positive integer
statement
(
not
(
exists
(?PATH1 ?PATH2)
(
and
(
instance
?PATH1
(
CutSetFn
?GRAPH))
(
instance
?PATH2
(
MinimalCutSetFn
?GRAPH))
(
pathLength
?PATH1 ?NUMBER1)
(
pathLength
?PATH2 ?NUMBER2)
(
lessThan
?NUMBER1 ?NUMBER2))))
Merge.kif 6100-6107
There don't exist
a graph path
and
another graph path
such that
the graph path
is an
instance
of the
set
of paths that partition
a graph
into two separate graphs and
the other graph path
is an
instance
of the
set
of minimal paths that partition
the graph
into two separate graphs and the
length
of
the graph path
is
a positive integer
and the
length
of
the other graph path
is
another positive integer
and
the positive integer
is
less
than
the other positive integer
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