Abstract

In the exact learning model of Angluin [1], a learning algorithm must discover an unknown function that is a member of a known class of Boolean functions. The learning algorithm can make at least one of the following types of queries about: Equivalence query, for a candidate function: The reply is either ”yes”, if! , or a counterexample " with #$ " & % ' $ " , otherwise. Membership query () $ " , for some "+*,: The reply is the Boolean value $ ". Subset query-/.102, for a candidate function: The reply is ”yes”, if 435, or a counterexample " with $ " 768#9 " , otherwise. Superset query-/.1:2 9, for a candidate function: The reply is ”yes”, if;35, or a counterexample " with #9 " <6=>9 " , otherwise.

Citations