Subclass reachability

This is an old revision of this page, as edited by BattyBot (talk | contribs) at 09:18, 3 March 2012 (merged templates into Template:Multiple issues & general fixes using AWB (7961)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In exact concept learning in mathematics, 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).