Relationships




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. 
 antisymmetric relation  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. 
 asymmetric relation  A BinaryRelation is asymmetric if and only if it is both an AntisymmetricRelation and an IrreflexiveRelation. 
 binary predicate  A Predicate relating two items  its valence is two. 
 binary relation  BinaryRelations are relations that are true only of pairs of things. BinaryRelations are represented as slots in frame systems. 
 case role  The Class of Predicates relating the spatially distinguished parts of a Process. CaseRoles include, for example, the agent, patient or destination of an action, the flammable substance in a burning process, or the water that falls in rain. 
 entity  The universal class of individuals. This is the root node of the ontology. 
 inheritable relation  The class of Relations whose properties can be inherited downward in the class hierarchy via the subrelation Predicate. 
 irreflexive relation  Relation ?REL is irreflexive iff (?REL ?INST ?INST) holds for no value of ?INST. 
 partial valued relation  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 sentenceforming 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 three kinds of Relation: Predicate, Function, and List. Predicates and Functions both denote sets of ordered ntuples. The difference between these two Classes is that Predicates cover formulaforming operators, while Functions cover termforming operators. A List, on the other hand, is a particular ordered ntuple. 
Belongs to Class

asymmetric relation 
  