In computational learning theory 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).



This article uses material from the Wikipedia article Subclass reachability, which is released under the Creative Commons Attribution-Share-Alike License 3.0.