Relationsumo#disjoint_relation(pm#relation_type+)(sumo#disjointRelation @ROW) means that any two relations in @ROW have no tuples in common; as a consequence, the intersection of all of the relations in @ROW is the null setrelated_to: sumo#disjoint type: pm#predicate_type__predicatetypea sentence-forming relation with each tuple being a finite, ordered sequence of objectstype: pm#variable_arity_relation_typeclass of relations that do not have a fixed number of argumentssupertype: pm#relation_from_relation_type (pm#relation_type,*) supertype: pm#relation_from_type (pm#type,*)type of relations from a concept/relation type, i.e. in RDFS terminology, from a class or a propertysupertype: pm#relation_from_collection (pm#collection,*) supertype: pm#relation_from/to_thing_of_common_kind (*)this type permits to categorize relations according to their signatures and hence offers (i) a concise way to set essential exclusion relations, and (ii) a systematic and easy-to-follow categorizationsupertype: pm#relation__related_thing__relatedthing___related_with (*)type for any relation (unary, binary, ..., *-ary) and instance of pm#relation_typesupertype: pm#what_relation (*) supertype: pm#wh-/how_relation (*)this type permits to categorize relations according to the usual who/what/why/where/when/how questions ; this is a traditional but very subjective and ineffective way of categorizing relationssupertype: pm#relation__related_thing__relatedthing___related_with (*)type for any relation (unary, binary, ..., *-ary) and instance of pm#relation_type