Subclass reachability: Difference between revisions

Revision as of 00:01, 3 January 2009

Latest revision as of 17:03, 18 December 2021

(17 intermediate revisions by 13 users not shown)

Line 1:

#REDIRECT [[Concept class]]

{{unreferenced}}

{{R from merge}}

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

==See also==

[[Exclusion dimension]]

{{math-stub}}