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

Formal Language: 




Sigma KEE - PartialOrderingRelation
KB Term: 
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
偏序关系
一个 BinaryRelation 属于部分顺序 关系如果它是一个 ReflexiveRelation、 AntisymmetricRelation 和 TransitiveRelation。
Relationships      
Parents 反对称关系 BinaryRelation ?REL is an AntisymmetricRelation if for distinct ?INST1 and ?INST2, (?REL ?INST1 ?INST2) implies not (?REL ?INST2 ?INST1). In other words, for all ?INST1 and ?INST2, (?REL ?INST1 ?INST2) and (?REL ?INST2 ?INST1) imply that ?INST1 and ?INST2 are identical. Note that it is possible for an AntisymmetricRelation to be a ReflexiveRelation.
  自反关系 Relation ?REL is reflexive iff (?REL ?INST ?INST) for all ?INST.
  总值关系 A Relation is a TotalValuedRelation just in case there exists an assignment for the last argument position of the Relation given any assignment of values to every argument position except the last one. Note that declaring a Relation to be both a TotalValuedRelation and a SingleValuedRelation means that it is a total function.
  传递关系 A BinaryRelation ?REL is transitive if (?REL ?INST1 ?INST2) and (?REL ?INST2 ?INST3) imply (?REL ?INST1 ?INST3), for all ?INST1, ?INST2, and ?INST3.
Children 全序关系A BinaryRelation is a TotalOrderingRelation if it is a PartialOrderingRelation and a TrichotomizingRelation.


Show simplified definition with tree view
Show full definition (without tree view)
Show full definition (with tree view)


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