Subclass reachability

This is an old revision of this page, as edited by Malcolma (talk | contribs) at 10:44, 21 February 2011 (cat). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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).

See also

Exclusion dimension