Semantic Web for the Working Ontologist, 2nd Edition

Set Union

Using a pattern similar to the one we used for set intersection, we can also express certain things about set unions in RDFS. In particular, we can express that A ∪ B ⊆ C. We do this by making C a common superclass of A and B, thus:

Any instance ?x that is a member of either A or B is inferred to be also a member of C; that is,

or

implies

EXAMPLE All Stars

In determining the candidates for a season's All Stars, a league's rules ...