subrelation Comparison Table

Next BinaryPredicate: subsumesContentClass Up: BinaryPredicate, PartialOrderingRelation Previous BinaryPredicate: subProcess

subrelation comparison table

Subject have domain2 have domain1 be first domain of documentation have axiom is a kind of is an instance of

BinaryPredicate singleValued A Predicate relating two items - its valence is two
(=>
(instance ?REL BinaryPredicate)
(valence ?REL 2))
Predicate

PartialOrderingRelation trichotomizingOn A BinaryRelation is a partial ordering if it is a ReflexiveRelation, an AntisymmetricRelation, and a TransitiveRelation
(=>
(instance ?REL TransitiveRelation)
(forall (?INST1 ?INST2 ?INST3)
(=>
(and
(holds ?REL ?INST1 ?INST2)
(holds ?REL ?INST2 ?INST3))
(holds ?REL ?INST1 ?INST3))))
TransitiveRelation

subrelation Relation Relation singleValued A Relation R is a subrelation Relation R' if R is a subclass R'. This implies that every tuple of R is also a tuple of R'. Again, if R holds for some arguments arg_1, arg_2, ... arg_n, then R' holds for the same arguments. Thus, a Relation and its subrelation must have the same valence. In CycL, subrelation is called #$genlPreds
(=>
(subrelation ?PRED1 ?PRED2)
(exists (?NUMBER)
(and
(valence ?PRED1 ?NUMBER)
(valence ?PRED2 ?NUMBER))))
PartialOrderingRelation

Subject	have domain2	have domain1	be first domain of	documentation	have axiom	is a kind of	is an instance of
BinaryPredicate			singleValued	A Predicate relating two items - its valence is two	(=> (instance ?REL BinaryPredicate) (valence ?REL 2))	Predicate
PartialOrderingRelation			trichotomizingOn	A BinaryRelation is a partial ordering if it is a ReflexiveRelation, an AntisymmetricRelation, and a TransitiveRelation	(=> (instance ?REL TransitiveRelation) (forall (?INST1 ?INST2 ?INST3) (=> (and (holds ?REL ?INST1 ?INST2) (holds ?REL ?INST2 ?INST3)) (holds ?REL ?INST1 ?INST3))))	TransitiveRelation
subrelation	Relation	Relation	singleValued	A Relation R is a subrelation Relation R' if R is a subclass R'. This implies that every tuple of R is also a tuple of R'. Again, if R holds for some arguments arg_1, arg_2, ... arg_n, then R' holds for the same arguments. Thus, a Relation and its subrelation must have the same valence. In CycL, subrelation is called #$genlPreds	(=> (subrelation ?PRED1 ?PRED2) (exists (?NUMBER) (and (valence ?PRED1 ?NUMBER) (valence ?PRED2 ?NUMBER))))		PartialOrderingRelation

Next BinaryPredicate: subsumesContentClass Up: BinaryPredicate, PartialOrderingRelation Previous BinaryPredicate: subProcess