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

Formal Language: 



KB Term: 

  fullName

Sigma KEE - fullName
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
fullName
(fullName ?STRING ?OBJ) means that ?STRING is a (more or less) complete name for ?OBJ, having all of the parts (fields, name components) possible for ?OBJ's name. The parts of ?STRING, if any, may be in conventional order, or in indexed (for alphabetic sorting) order. Examples: George W. Bush, The White House, The United Kingdom of Great Britain and Northern Ireland.
Relationships      
Parents names (names ?STRING ?ENTITY) means that the thing ?ENTITY has the SymbolicString ?STRING as its name. Note that names and represents are the two immediate subrelations of refers. The predicate names is used when the referring item is merely a tag without connotative content, while the predicate represents is used for referring items that have such content.
Children conventionalLongName(conventionalLongName ?NAME ?THING) means that the string ?NAME is the long form of the name conventionally used for ?THING.
 fullNameIndexOrder(fullNameIndexOrder ?STRING ?OBJ) means that ?STRING is a full name for ?OBJ, having all of the subStrings (fields, components) that occur in ?OBJ's complete name. The first component of ?STRING will be the indexed subString identified by keyName. Example: Bush, George W.
InstancesabstraitProperties 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.
 relation antisym�triqueBinaryRelation ?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.
 relation asym�triqueA BinaryRelation is asymmetric if and only if it is both an AntisymmetricRelation and an IrreflexiveRelation.
 pr�dicat binaireA Predicate relating two items - its valence is two.
 relation binaireBinaryRelations are relations that are true only of pairs of things. BinaryRelations are represented as slots in frame systems.
 entit�The 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.
 relation irr�flexiveRelation ?REL is irreflexive iff (?REL ?INST ?INST) holds for no value of ?INST.
 predicatA 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.
Belongs to Class entit�


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 3.0 is open source software produced by Articulate Software and its partners