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
links
Sigma KEE - links
links
appearance as argument number 1
(
documentation
links
ChineseLanguage
"这是一个
TernaryPredicate
, 它指定联系两个
GraphNode
的
GraphArc
。")
chinese_format.kif 2347-2348
(
documentation
links
EnglishLanguage
"a
TernaryPredicate
that specifies the
GraphArc
connecting two
GraphNode
s.")
Merge.kif 5878-5879
(
documentation
links
JapaneseLanguage
"
TernaryPredicate
は、2つの
GraphNode
を接続してい る
GraphArc
を指定する 。")
japanese_format.kif 1022-1023
(
domain
links
1
GraphNode
)
Merge.kif 5874-5874
(
domain
links
2
GraphNode
)
Merge.kif 5875-5875
(
domain
links
3
GraphArc
)
Merge.kif 5876-5876
(
instance
links
TernaryPredicate
)
Merge.kif 5873-5873
appearance as argument number 2
(
format
ChineseLanguage
links
"%3 %n{doesn't}
links
%1 和 %2")
chinese_format.kif 747-747
(
format
EnglishLanguage
links
"%3 %n{doesn't} link%p{s} %1 and %2")
english_format.kif 749-749
(
format
FrenchLanguage
links
"%3 %n{ne} lie %n{pas} %1 et %2")
french_format.kif 451-451
(
format
ItalianLanguage
links
"%3 %n{non} lega%p{s} %1 e %2")
relations-it.txt 165-165
(
format
JapaneseLanguage
links
"%3 は %1 と %2 を link%p{s} %n{ない}")
japanese_format.kif 2159-2159
(
format
PortugueseLanguage
links
"%3 %n{nao} liga %n %1 e %2")
portuguese_format.kif 403-403
(
format
cz
links
"%3 %n{ne}spojuje %1 a %2")
relations-cz.txt 464-464
(
format
de
links
"%3 verbindet %1 und %2 %n{nicht}")
relations-de.txt 963-963
(
format
hi
links
"%3 %1 aura %2 ko %n{nahiin} jodataa hai")
relations-hindi.txt 204-204
(
format
ro
links
"%3 %n{nu} link%t{leagã} %1 ºi %2")
relations-ro.kif 473-473
(
format
sv
links
"%3 länkar %n{inte} ihop %1 och %2")
relations-sv.txt 516-516
(
format
tg
links
"%3 %n ay ikabit %1 at %2")
relations-tg.txt 329-329
(
termFormat
ChineseLanguage
links
"连接")
chinese_format.kif 748-748
(
termFormat
ChineseLanguage
links
"链接")
domainEnglishFormat.kif 34559-34559
(
termFormat
ChineseTraditionalLanguage
links
"鏈接")
domainEnglishFormat.kif 34558-34558
(
termFormat
EnglishLanguage
links
"links")
domainEnglishFormat.kif 34557-34557
(
termFormat
tg
links
"ikabit")
relations-tg.txt 330-330
antecedent
(=>
(
and
(
graphPart
?ARC1 ?GRAPH)
(
graphPart
?ARC2 ?GRAPH)
(
graphPart
?NODE1 ?GRAPH)
(
graphPart
?NODE2 ?GRAPH)
(
links
?NODE1 ?NODE2 ?ARC1)
(
links
?NODE1 ?NODE2 ?ARC2)
(
not
(
equal
?ARC1 ?ARC2)))
(
instance
?GRAPH
MultiGraph
))
Merge.kif 5791-5800
(=>
(
links
?NODE ?NODE ?LOOP)
(
instance
?LOOP
GraphLoop
))
Merge.kif 5863-5865
(=>
(
links
?NODE1 ?NODE2 ?ARC)
(
links
?NODE2 ?NODE1 ?ARC))
Merge.kif 5881-5883
consequent
(=>
(
and
(
connects
?A ?NODE1 ?NODE2)
(
abstractCounterpart
?N1 ?NODE1)
(
abstractCounterpart
?N2 ?NODE2)
(
abstractCounterpart
?ARC ?A))
(
links
?N1 ?N2 ?ARC))
Transportation.kif 2903-2909
(=>
(
and
(
instance
?GRAPH
Graph
)
(
instance
?NODE1
GraphNode
)
(
instance
?NODE2
GraphNode
)
(
graphPart
?NODE1 ?GRAPH)
(
graphPart
?NODE2 ?GRAPH)
(
not
(
equal
?NODE1 ?NODE2)))
(
exists
(?ARC ?PATH)
(
or
(
links
?NODE1 ?NODE2 ?ARC)
(
and
(
subGraph
?PATH ?GRAPH)
(
instance
?PATH
GraphPath
)
(
or
(
and
(
equal
(
BeginNodeFn
?PATH) ?NODE1)
(
equal
(
EndNodeFn
?PATH) ?NODE2))
(
and
(
equal
(
BeginNodeFn
?PATH) ?NODE2)
(
equal
(
EndNodeFn
?PATH) ?NODE1)))))))
Merge.kif 5631-5651
(=>
(
instance
?ARC
GraphArc
)
(
exists
(?NODE1 ?NODE2)
(
links
?NODE1 ?NODE2 ?ARC)))
Merge.kif 5848-5851
(=>
(
instance
?GRAPH
Graph
)
(
exists
(?NODE1 ?NODE2 ?NODE3 ?ARC1 ?ARC2)
(
and
(
graphPart
?NODE1 ?GRAPH)
(
graphPart
?NODE2 ?GRAPH)
(
graphPart
?NODE3 ?GRAPH)
(
graphPart
?ARC1 ?GRAPH)
(
graphPart
?ARC2 ?GRAPH)
(
links
?NODE1 ?NODE2 ?ARC1)
(
links
?NODE2 ?NODE3 ?ARC2)
(
not
(
equal
?NODE1 ?NODE2))
(
not
(
equal
?NODE2 ?NODE3))
(
not
(
equal
?NODE1 ?NODE3))
(
not
(
equal
?ARC1 ?ARC2)))))
Merge.kif 5653-5667
(=>
(
instance
?GRAPH
MultiGraph
)
(
exists
(?ARC1 ?ARC2 ?NODE1 ?NODE2)
(
and
(
graphPart
?ARC1 ?GRAPH)
(
graphPart
?ARC2 ?GRAPH)
(
graphPart
?NODE1 ?GRAPH)
(
graphPart
?NODE2 ?GRAPH)
(
links
?NODE1 ?NODE2 ?ARC1)
(
links
?NODE1 ?NODE2 ?ARC2)
(
not
(
equal
?ARC1 ?ARC2)))))
Merge.kif 5778-5789
(=>
(
instance
?LOOP
GraphLoop
)
(
exists
(?NODE)
(
links
?NODE ?NODE ?LOOP)))
Merge.kif 5858-5861
(=>
(
instance
?NODE
GraphNode
)
(
exists
(?OTHER ?ARC)
(
links
?NODE ?OTHER ?ARC)))
Merge.kif 5838-5841
(=>
(
links
?NODE1 ?NODE2 ?ARC)
(
links
?NODE2 ?NODE1 ?ARC))
Merge.kif 5881-5883
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