Subclass reachability: Difference between revisions

Content deleted Content added
m spelling correction
m +orphan
Line 1:
{{Unreferenced|date=January 2009}}
{{Context|date=February 2011}}
{{Orphan|date=November 2011}}
 
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).