contraryProperty Comparison Table

Entity > Abstract > Class > Relation > BinaryRelation > BinaryPredicate > contraryProperty

Next BinaryPredicate: cooccur Up: BinaryPredicate, IrreflexiveRelation, SymmetricRelation, TransitiveRelation Previous BinaryPredicate: containsInformation

contraryProperty 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

IrreflexiveRelation trichotomizingOn Relation ?REL is irreflexive if (?REL ?INST ?INST) holds for no value of ?INST
(=>
(instance ?REL IrreflexiveRelation)
(forall (?INST)
(not
(holds ?REL ?INST ?INST))))
BinaryRelation

SymmetricRelation trichotomizingOn A BinaryRelation ?REL is symmetric just in case (?REL ?INST1 ?INST2) imples (?REL ?INST2 ?INST1), for all ?INST1 and ?INST2
(=>
(instance ?REL SymmetricRelation)
(forall (?INST1 ?INST2)
(=>
(holds ?REL ?INST1 ?INST2)
(holds ?REL ?INST2 ?INST2))))
BinaryRelation

TransitiveRelation trichotomizingOn A BinaryRelation ?REL is transitive if (?REL ?INST1 ?INST2) and (?REL ?INST2 ?INST3) imply (?REL ?INST1 ?INST3), for all ?INST1, ?INST2, and ?INST3
(=>
(instance ?REL TransitiveRelation)
(forall (?INST1 ?INST2 ?INST3)
(=>
(and
(holds ?REL ?INST1 ?INST2)
(holds ?REL ?INST2 ?INST3))
(holds ?REL ?INST1 ?INST3))))
BinaryRelation

contraryProperty Attribute Attribute singleValued Means that the two arguments are properties that are opposed to one another, e.g. Pliable versus Rigid
(=>
(and
(attribute ?OBJ ?ATTR1)
(contraryProperty ?ATTR1 ?ATTR2))
(not
(attribute ?OBJ ?ATTR2)))
TransitiveRelation

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
IrreflexiveRelation			trichotomizingOn	Relation ?REL is irreflexive if (?REL ?INST ?INST) holds for no value of ?INST	(=> (instance ?REL IrreflexiveRelation) (forall (?INST) (not (holds ?REL ?INST ?INST))))	BinaryRelation
SymmetricRelation			trichotomizingOn	A BinaryRelation ?REL is symmetric just in case (?REL ?INST1 ?INST2) imples (?REL ?INST2 ?INST1), for all ?INST1 and ?INST2	(=> (instance ?REL SymmetricRelation) (forall (?INST1 ?INST2) (=> (holds ?REL ?INST1 ?INST2) (holds ?REL ?INST2 ?INST2))))	BinaryRelation
TransitiveRelation			trichotomizingOn	A BinaryRelation ?REL is transitive if (?REL ?INST1 ?INST2) and (?REL ?INST2 ?INST3) imply (?REL ?INST1 ?INST3), for all ?INST1, ?INST2, and ?INST3	(=> (instance ?REL TransitiveRelation) (forall (?INST1 ?INST2 ?INST3) (=> (and (holds ?REL ?INST1 ?INST2) (holds ?REL ?INST2 ?INST3)) (holds ?REL ?INST1 ?INST3))))	BinaryRelation
contraryProperty	Attribute	Attribute	singleValued	Means that the two arguments are properties that are opposed to one another, e.g. Pliable versus Rigid	(=> (and (attribute ?OBJ ?ATTR1) (contraryProperty ?ATTR1 ?ATTR2)) (not (attribute ?OBJ ?ATTR2)))		TransitiveRelation

Next BinaryPredicate: cooccur Up: BinaryPredicate, IrreflexiveRelation, SymmetricRelation, TransitiveRelation Previous BinaryPredicate: containsInformation