ブール関数
In algorithmic learning theory, a "concept" over a domain "X" is a Boolean function over "X". Here we only consider finite domains. A "partial approximation" "S" of a concept "c" is a Boolean function over formula_1 such that "c" is an extension to "S".