|
Relationships
|
|
|
|
| Parents |
superficialPart |
(superficialPart ?OBJ1 ?OBJ2) means that ?OBJ1 is a part of ?OBJ2 that has no interior parts of its own (or, intuitively, that only overlaps those parts of ?OBJ2 that are externally connected with the mereological complement of ?OBJ2). This too is a transitive relation closed under MereologicalSumFn and MereologicalProductFn.
|
| Instances | Abstract | 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. |
| | BinaryPredicate | A Predicate relating two items - its valence is two. |
| | BinaryRelation | BinaryRelations are relations that are true only of pairs of things. BinaryRelations are represented as slots in frame systems. |
| | Entity | 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. |
| | IrreflexiveRelation | Relation ?REL is irreflexive iff (?REL ?INST ?INST) holds for no value of ?INST. |
| | PartialValuedRelation | 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. |
| | Predicate | 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. |
| | TransitiveRelation | 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
|
Entity |
| | |