Subclass reachability

Article
Talk

This is an old revision of this page, as edited by SmackBot (talk | contribs) at 08:32, 4 January 2009 (Date maintenance tags and general fixes). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

This article does not cite any sources. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed.
Find sources: "Subclass reachability" – news · newspapers · books · scholar · JSTOR (January 2009) (Learn how and when to remove this message)

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

This mathematics-related article is a stub. You can help Wikipedia by expanding it.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Subclass_reachability&oldid=261856982"