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:
Tax
Sigma KEE - closedOn
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
closedOn
A
BinaryFunction
is closed on a
Class
if it is defined for all instances of the
Class
and its value is always an instance of the
Class
.
Relationships
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.
relation antisym�trique
BinaryRelation
?REL is an
AntisymmetricRelation
if for distinct ?INST1 and ?INST2, (?REL ?INST1 ?INST2) implies not (?REL ?INST2 ?INST1). In other words, for all ?INST1 and ?INST2, (?REL ?INST1 ?INST2) and (?REL ?INST2 ?INST1) imply that ?INST1 and ?INST2 are identical. Note that it is possible for an
AntisymmetricRelation
to be a
ReflexiveRelation
.
relation asym�trique
A
BinaryRelation
is asymmetric if and only if it is both an
AntisymmetricRelation
and an
IrreflexiveRelation
.
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
.
relation irr�flexive
Relation
?REL is irreflexive iff (?REL ?INST ?INST) holds for no value of ?INST.
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
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.
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