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

Formal Language: 




Sigma KEE - width
KB Term: 
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
width
BinaryPredicate that is used to state the measure of an Object from side to side at its widest span.
Relationships      
Parents linearExtent BinaryPredicate that is used to state the measure of an Object from one point to another point along its surface. Note that the difference between the predicates length and distance is that the length is used to state the LengthMeasure of one of the dimensions of a single object, while distance is used to state the LengthMeasure that separates two distinct objects.
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.
 AntisymmetricRelationBinaryRelation ?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.
 AsymmetricRelationA BinaryRelation is asymmetric if and only if it is both an AntisymmetricRelation and an IrreflexiveRelation.
 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.
 IrreflexiveRelationRelation ?REL is irreflexive iff (?REL ?INST ?INST) holds for no value of ?INST.
 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'.
 RelationThe 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.
 SingleValuedRelationA Relation is a SingleValuedRelation just in case an assignment of values to every argument position except the last one determines at most one assignment for the last argument position. Note that not all SingleValuedRelations are TotalValuedRelations.
Belongs to Class AsymmetricRelation


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


Sigma web home      Suggested Upper Merged Ontology (SUMO) web home
Sigma version 3.0 is open source software produced by Articulate Software and its partners