: Welcome guest :
Sigma KEE - filename
A relation between a
and an instance of
that specified the filename of the data on a particular computer file system. This relation is for a fully qualified filename including a device specification such as a drive letter or name, a directory, and a name. This can include names that are aliases for a different physical file location. It does not include the specification of a particular machine on a network, such as an internet domain name, although it may reference a device specification that ultimately resolves to a storage device on a network.
?STRING ?ENTITY) means that the thing ?ENTITY has the
?STRING as its name. Note that
are the two immediate
. The predicate
is used when the referring item is merely a tag without connotative content, while the predicate
is used for referring items that have such content.
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.
relating two items - its valence is two.
s are relations that are true only of pairs of things.
s are represented as slots in frame systems.
The universal class of individuals. This is the root node of the ontology.
The class of
s whose properties can be inherited downward in the class hierarchy via the
partial valued relation
just in case it is not a
, i.e. just in case assigning values to every argument position except the last one does not necessarily mean that there is a value assignment for the last argument position. Note that, if a
is both a
, then it is a partial function.
is a sentence-forming
. Each tuple in the
is a finite, ordered sequence of objects. The fact that a particular tuple is an element of a
is denoted by '(*predicate* arg_1 arg_2 .. arg_n)', where the arg_i are the objects so related. In the case of
s, the fact can be read as `arg_1 is *predicate* arg_2' or `a *predicate* of arg_1 is arg_2'.
of relations. There are two kinds of
s both denote sets of ordered n-tuples. The difference between these two
es is that
s cover formula-forming operators, while
s cover term-forming operators.
Belongs to Class
Show simplified definition with tree view
Show full definition (without tree view)
Show full definition (with tree view)
Sigma web home
Suggested Upper Merged Ontology (SUMO) web home
Sigma version 3.0 is
open source software
and its partners