SUMO   View all facts   Glossary   Help
Entity > Abstract > Class > Relation > BinaryRelation > BinaryPredicate > successorAttributeClosure
Next BinaryPredicate: temporalPart    Up: BinaryPredicate, IrreflexiveRelation, TransitiveRelation    Previous BinaryPredicate: successorAttribute   

successorAttributeClosure comparison table
Subject have domain2 have domain1 be first domain of documentation have axiom is a kind of is an instance of have relatedInternalConcept
BinaryPredicate  singleValuedA Predicate relating two items - its valence is two
(=>
 	(instance ?REL BinaryPredicate)
 	(valence ?REL 2))
Predicate  
IrreflexiveRelation  trichotomizingOnRelation ?REL is irreflexive if (?REL ?INST ?INST) holds for no value of ?INST
(=>
    (instance ?REL IrreflexiveRelation)
    (forall (?INST)
       (not 
          (holds ?REL ?INST ?INST))))
BinaryRelation  
TransitiveRelation  trichotomizingOnA 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  
successorAttributeClosureAttributeAttributesingleValuedThe transitive closure of successorAttribute. (successorAttributeClosure ?ATTR1 ?ATTR2) means that there is a chain of successorAttribute assertions connecting ?ATTR1 and ?ATTR2
(=>
    (successorAttribute ?ATTR1 ?ATTR2)
    (successorAttributeClosure ?ATTR1 ?ATTR2))
 TransitiveRelationsuccessorAttribute

Next BinaryPredicate: temporalPart    Up: BinaryPredicate, IrreflexiveRelation, TransitiveRelation    Previous BinaryPredicate: successorAttribute