Simple Browser : Welcome guest : log in
Home |  Graph |  ]  KB:  Language:   

Formal Language: 



KB Term: 

  connected

Sigma KEE - connected
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
connected
(connected ?OBJ1 ?OBJ2) means that ?OBJ1 meetsSpatially ?OBJ2 or that ?OBJ1 overlapsSpatially ?OBJ2.
Relationships      
Children connectedEngineeringComponentsThis 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.
 overlapsSpatially(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.
InstancesAbstractProperties 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.
 BinaryPredicateA Predicate relating two items - its valence is two.
 BinaryRelationBinaryRelations are relations that are true only of pairs of things. BinaryRelations are represented as slots in frame systems.
 EntityThe universal class of individuals. This is the root node of the ontology.
 InheritableRelationThe class of Relations whose properties can be inherited downward in the class hierarchy via the subrelation Predicate.
 PredicateA 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'.
 ReflexiveRelationRelation ?REL is reflexive iff (?REL ?INST ?INST) for all ?INST.
 RelationThe Class of relations. There are three kinds of Relation: Predicate, Function, and List. 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. A List, on the other hand, is a particular ordered n-tuple.
 SpatialRelationThe Class of Relations that are spatial in a wide sense. This Class includes mereological relations and topological relations.
 SymmetricRelationA BinaryRelation ?REL is symmetric just iff (?REL ?INST1 ?INST2) imples (?REL ?INST2 ?INST1), for all ?INST1 and ?INST2.
Belongs to Class Entity


Show full definition (without tree view)
Show full definition (with tree view)

Show without tree


Sigma web home      Suggested Upper Merged Ontology (SUMO) web home
Sigma version 2.99c (>= 2017/11/20) is open source software produced by Articulate Software and its partners