Subclass reachability: Difference between revisions

Revision as of 03:18, 18 April 2011

Revision as of 23:25, 16 July 2011

Line 2:

{{Context|date=February 2011}}

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