SUMO View all facts Glossary Help |
Entity > Abstract > Class > Relation > Predicate > exhaustiveDecomposition |
exhaustiveDecomposition comparison table |
Subject | have domain1 | be first domain of | documentation | have axiom | is a kind of | is an instance of | have relatedInternalConcept |
---|---|---|---|---|---|---|---|
Predicate | singleValued | A 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' | (forall (?INT) (domain exhaustiveDecomposition ?INT Class)) | Relation | |||
VariableArityRelation | valence | The Class of Relations that do not have a fixed number of arguments | (=> | Relation | |||
exhaustiveDecomposition | Class | singleValued | An exhaustiveDecomposition of a Class C is a set of subclasses of C such that every subclass of C either is an element of the set or is a subclass of an element of the set. Note: this does not necessarily mean that the elements of the set are disjoint (see partition - a partition is a disjoint exhaustive decomposition. | (forall (?INT) (domain exhaustiveDecomposition ?INT Class)) | VariableArityRelation | partition |
Next Predicate: holds Up: Predicate, VariableArityRelation Previous Predicate: disjointDecomposition