Subclass reachability: Difference between revisions

Revision as of 19:23, 7 July 2014

Revision as of 12:10, 7 January 2015

Line 1:

{{Multiple issues|

{{Multiple issues|unreferenced = January 2009|context = February 2011|orphan = November 2011}}

{{unreferenced|date=January 2009}}

{{orphan|date=November 2011}}

{{context|date=February 2011}}

}}

In [[computational learning theory]] in [[mathematics]], given a [[Concept class|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).