Simple Browser
: 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:
connected
Sigma KEE - connected
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
connected
(connected ?OBJ1 ?OBJ2) means that ?OBJ1
meetsSpatially
?OBJ2 or that ?OBJ1
overlapsSpatially
?OBJ2.
Relationships
Children
connectedEngineeringComponents
This is the most general connection relation between
EngineeringComponent
s. If (
connectedEngineeringComponents
?COMP1 ?COMP2), then neither ?COMP1 nor ?COMP2 can be an
engineeringSubcomponent
of the other. The relation
connectedEngineeringComponents
is a
SymmetricRelation
, there is no information in the direction of connection between two components. It is also an
IrreflexiveRelation
, no
EngineeringComponent
bears this relation to itself. Note that this relation does not associate a name or type with the connection.
overlapsSpatially
(
overlapsSpatially
?OBJ1 ?OBJ2) means that the
Object
s ?OBJ1 and ?OBJ2 have some parts in common. This is a reflexive and symmetric (but not transitive) relation.
Instances
abstrait
Properties or qualities as distinguished from any particular embodiment of the properties/qualities in a physical medium. Instances of Abstract can be said to exist in the same sense as mathematical objects such as sets and relations, but they cannot exist at a particular place and time without some physical encoding or embodiment.
pr�dicat binaire
A
Predicate
relating two items - its valence is two.
relation binaire
BinaryRelation
s are relations that are true only of pairs of things.
BinaryRelation
s are represented as slots in frame systems.
entit�
The universal class of individuals. This is the root node of the ontology.
InheritableRelation
The class of
Relation
s whose properties can be inherited downward in the class hierarchy via the
subrelation
Predicate
.
predicat
A
Predicate
is a sentence-forming
Relation
. Each tuple in the
Relation
is a finite, ordered sequence of objects. The fact that a particular tuple is an element of a
Predicate
is denoted by '(*predicate* arg_1 arg_2 .. arg_n)', where the arg_i are the objects so related. In the case of
BinaryPredicate
s, the fact can be read as `arg_1 is *predicate* arg_2' or `a *predicate* of arg_1 is arg_2'.
relation r�flexive
Relation
?REL is reflexive iff (?REL ?INST ?INST) for all ?INST.
relation
The
Class
of relations. There are two kinds of
Relation
:
Predicate
and
Function
.
Predicate
s and
Function
s both denote sets of ordered n-tuples. The difference between these two
Class
es is that
Predicate
s cover formula-forming operators, while
Function
s cover term-forming operators.
relation spatial
The
Class
of
Relation
s that are spatial in a wide sense. This
Class
includes mereological relations and topological relations.
relation sym�trique
A
BinaryRelation
?REL is symmetric just iff (?REL ?INST1 ?INST2) imples (?REL ?INST2 ?INST1), for all ?INST1 and ?INST2.
Belongs to Class
entit�
Show full definition (without tree view)
Show full 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