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

Formal Language: 



KB Term: 

  superficialPart

Sigma KEE - superficialPart
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
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.
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.
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.
 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.
 IrreflexiveRelationRelation ?REL is irreflexive iff (?REL ?INST ?INST) holds for no value of ?INST.
 PartialValuedRelationA 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.
 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.
 TransitiveRelationA 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


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