Relationships
|
|
|
|
Children |
bottom | (bottom ?BOTTOM ?OBJECT) holds if ?BOTTOM is the lowest or deepest maximal superficial part of ?OBJECT. |
| side | (side ?SIDE ?OBJECT) means that ?SIDE is a side of the object, as opposed to the top or bottom. |
| surface | (surface ?OBJ1 ?OBJ2) means that ?OBJ1 is a maximally connected superficialPart of ?OBJ2. Note that some SelfConnectedObjects have more than one surface, e.g. a hollow object like a tennis ball has both an inner and an outer surface. |
| top | (top ?TOP ?OBJECT) means that ?TOP is the highest maximal superficial part of ?OBJECT. |
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 | BinaryRelations are relations that are true only of pairs of things. BinaryRelations 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 Relations 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. |
| relation partielle | A Relation is a PartialValuedRelation just in case it is not a TotalValuedRelation, 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 Relation is both a PartialValuedRelation and a SingleValuedRelation, then it is a partial function. |
| 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 BinaryPredicates, 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. Predicates and Functions both denote sets of ordered n-tuples. The difference between these two Classes is that Predicates cover formula-forming operators, while Functions cover term-forming operators. |
| relation transitive | A BinaryRelation ?REL is transitive if (?REL ?INST1 ?INST2) and (?REL ?INST2 ?INST3) imply (?REL ?INST1 ?INST3), for all ?INST1, ?INST2, and ?INST3. |
Belongs to Class
|
entit� |
| | |