Subclass reachability
From HandWiki - Reading time: 1 min
In computational learning theory 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).
 |
Licensed under CC BY-SA 3.0 | Source: https://handwiki.org/wiki/Subclass_reachability2 views | Status: cached on August 25 2024 11:24:20↧ Download this article as ZWI file
EncycloReader
is supported by the 
KSF