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

Formal Language: 



KB Term: 

  domain

 Sigma KEE - domain
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
definitionsbereich
Provides a computationally and heuristically convenient mechanism for declaring the argument types of a given relation. The formula (domain ?REL ?INT ?CLASS) means that the ?INT'th element of each tuple in the relation ?REL must be an instance of ?CLASS. Specifying argument types is very helpful in maintaining ontologies. Representation systems can use these specifications to classify terms and check integrity constraints. If the restriction on the argument type of a Relation is not captured by a Class already defined in the ontology, one can specify a Class compositionally with the functions UnionFn, IntersectionFn, etc.
Relationships      
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.
 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'.
 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.
 TernaryPredicateThe Class of Predicates that require exactly three arguments.
 TernaryRelationTernaryRelations relate three items. The two subclasses of TernaryRelation are TernaryPredicate and BinaryFunction.
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 3.0 is open source software produced by Articulate Software and its partners