~/ learn/ comp-378/ cards/ Constraints: Completeness & Disjointness
1 of 6

Type the four completeness × disjointness combinations.

Type the four completeness × disjointness combinations.

Answer

total / disjoint : every instance in exactly one subtype total / overlap : every instance in at least one (maybe several) partial / disjoint: at most one subtype, or none partial / overlap : zero, one, or many subtypes

Completeness (total/partial) and disjointness (disjoint/overlap) are independent, so every specialization is exactly one of these four. Total = double line; partial = single line; disjoint = d; overlap = o.

space flip · ← → navigate · esc to exit
NORMAL ~/memra/library/f60c9a7a-44f6-425b-954d-bd2a4d92737f/flashcard utf-8 LF