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 5877-5878
(
documentation
links
JapaneseLanguage
"
TernaryPredicate
は、2つの
GraphNode
を接続してい る
GraphArc
を指定する 。")
japanese_format.kif 1022-1023
(
domain
links
1
GraphNode
)
Merge.kif 5873-5873
The number 1 argument of
links
is an
instance
of
graph node
(
domain
links
2
GraphNode
)
Merge.kif 5874-5874
The number 2 argument of
links
is an
instance
of
graph node
(
domain
links
3
GraphArc
)
Merge.kif 5875-5875
The number 3 argument of
links
is an
instance
of
graph arc
(
instance
links
TernaryPredicate
)
Merge.kif 5872-5872
links
is an
instance
of
ternary predicate
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 5790-5799
If
a graph arc
is a
part
of
a graph
and
another graph arc
is a
part
of
the graph
and
a graph node
is a
part
of
the graph
and
another graph node
is a
part
of
the graph
and
the graph arc
link
s
the graph node
and
the other graph node
and
the other graph arc
link
s
the graph node
and
the other graph node
and
the graph arc
is not
equal
to
the other graph arc
,
then
the graph
is an
instance
of
multi graph
(=>
(
links
?NODE ?NODE ?LOOP)
(
instance
?LOOP
GraphLoop
))
Merge.kif 5862-5864
If
a graph arc
link
s
a graph node
and
the graph node
,
then
the graph arc
is an
instance
of
graph loop
(=>
(
links
?NODE1 ?NODE2 ?ARC)
(
links
?NODE2 ?NODE1 ?ARC))
Merge.kif 5880-5882
If
a graph arc
link
s
a graph node
and
another graph node
,
then
the graph arc
link
s
the other graph node
and
the graph node
consequent
(=>
(
and
(
connects
?A ?NODE1 ?NODE2)
(
abstractCounterpart
?N1 ?NODE1)
(
abstractCounterpart
?N2 ?NODE2)
(
abstractCounterpart
?ARC ?A))
(
links
?N1 ?N2 ?ARC))
Transportation.kif 2870-2876
If
an object
connect
s
another object
and
a third object
and the
abstract
counterpart
of
the other object
is
a graph node
and the
abstract
counterpart
of
the third object
is
another graph node
and the
abstract
counterpart
of
the object
is
the object
RC,
then
the object
RC
link
s
the graph node
and
the other graph node
(=>
(
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 5630-5650
If
a graph
is an
instance
of
graph
and
a graph node
is an
instance
of
graph node
and
another graph node
is an
instance
of
graph node
and
the graph node
is a
part
of
the graph
and
the other graph node
is a
part
of
the graph
and
the graph node
is not
equal
to
the other graph node
,
then there exist
a graph arc
and
a graph path
such that
the graph arc
link
s
the graph node
and
the other graph node
or
the graph path
is a
subgraph
of
the graph
and
the graph path
is an
instance
of
graph path
and the
beginning
of
the graph path
is
equal
to
the graph node
and the
end
of
the graph path
is
equal
to
the other graph node
or the
beginning
of
the graph path
is
equal
to
the other graph node
and the
end
of
the graph path
is
equal
to
the graph node
(=>
(
instance
?ARC
GraphArc
)
(
exists
(?NODE1 ?NODE2)
(
links
?NODE1 ?NODE2 ?ARC)))
Merge.kif 5847-5850
If
a graph arc
is an
instance
of
graph arc
,
then there exist
a graph node
and
another graph node
such that
the graph arc
link
s
the graph node
and
the other graph node
(=>
(
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 5652-5666
If
a graph
is an
instance
of
graph
,
then there exist
a graph node
,
another graph node
,, ,
a third graph node
,, ,
a graph arc
and
another graph arc
such that
the graph node
is a
part
of
the graph
and
the other graph node
is a
part
of
the graph
and
the third graph node
is a
part
of
the graph
and
the graph arc
is a
part
of
the graph
and
the other graph arc
is a
part
of
the graph
and
the graph arc
link
s
the graph node
and
the other graph node
and
the other graph arc
link
s
the other graph node
and
the third graph node
and
the graph node
is not
equal
to
the other graph node
and
the other graph node
is not
equal
to
the third graph node
and
the graph node
is not
equal
to
the third graph node
and
the graph arc
is not
equal
to
the other graph arc
(=>
(
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 5777-5788
If
a graph
is an
instance
of
multi graph
,
then there exist
a graph arc
,
another graph arc
,, ,
a graph node
and
another graph node
such that
the graph arc
is a
part
of
the graph
and
the other graph arc
is a
part
of
the graph
and
the graph node
is a
part
of
the graph
and
the other graph node
is a
part
of
the graph
and
the graph arc
link
s
the graph node
and
the other graph node
and
the other graph arc
link
s
the graph node
and
the other graph node
and
the graph arc
is not
equal
to
the other graph arc
(=>
(
instance
?LOOP
GraphLoop
)
(
exists
(?NODE)
(
links
?NODE ?NODE ?LOOP)))
Merge.kif 5857-5860
If
a graph arc
is an
instance
of
graph loop
,
then there exists
a graph node
such that
the graph arc
link
s
the graph node
and
the graph node
(=>
(
instance
?NODE
GraphNode
)
(
exists
(?OTHER ?ARC)
(
links
?NODE ?OTHER ?ARC)))
Merge.kif 5837-5840
If
a graph node
is an
instance
of
graph node
,
then there exist
another graph node
and
a graph arc
such that
the graph arc
link
s
the graph node
and
the other graph node
(=>
(
links
?NODE1 ?NODE2 ?ARC)
(
links
?NODE2 ?NODE1 ?ARC))
Merge.kif 5880-5882
If
a graph arc
link
s
a graph node
and
another graph node
,
then
the graph arc
link
s
the other graph node
and
the graph node
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