Subclass reachability

From Wikipedia, the free encyclopedia

In Exact concept learning, given a class of concepts C, a subclass D is reachable if there exists a partial approximation S of some concept such that D contains exactly those concepts in C that are extensions to S (i.e., D=C|S).

[edit] See also

Exclusion dimension