Relationships




Children 
connected engineering components  This is the most general connection relation between EngineeringComponents. If (connectedEngineeringComponents ?COMP1 ?COMP2), then neither ?COMP1 nor ?COMP2 can be an engineeringSubcomponent of the other. The relation connectedEngineeringComponents is a SymmetricRelation, there is no information in the direction of connection between two components. It is also an IrreflexiveRelation, no EngineeringComponent bears this relation to itself. Note that this relation does not associate a name or type with the connection. 
 flows  (flows ?FLUID1 ?FLUID2) means that the Physical ?FLUID1 moves towards the Physical ?FLUID2, to which it is connected. 
 overlaps spatially  (overlapsSpatially ?OBJ1 ?OBJ2) means that the Objects ?OBJ1 and ?OBJ2 have some parts in common. This is a reflexive and symmetric (but not transitive) relation. 
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. 
 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. 
 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. 
 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'. 
 reflexive relation  Relation ?REL is reflexive iff (?REL ?INST ?INST) for all ?INST. 
 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. 
 spatial relation  The Class of Relations that are spatial in a wide sense. This Class includes mereological relations and topological relations. 
 symmetric relation  A BinaryRelation ?REL is symmetric just iff (?REL ?INST1 ?INST2) imples (?REL ?INST2 ?INST1), for all ?INST1 and ?INST2. 
Belongs to Class

entity 
  