@article{3343,
  abstract     = {{In this paper we consider an extended variant of query learning where the hidden concept is embedded in some Boolean circuit. This additional processing layer modifies query arguments and answers by fixed transformation functions which are known to the learner. For this scenario, we provide a characterization of the solution space and an ordering on it. We give a compact representation of the minimal and maximal solutions as quantified Boolean formulas and we adapt the original algorithms for exact learning of specific classes of propositional formulas.}},
  author       = {{Bubeck, Uwe and Kleine Büning, Hans}},
  issn         = {{0004-3702}},
  journal      = {{Artificial Intelligence}},
  keywords     = {{Query learning, Propositional logic}},
  pages        = {{246 -- 257}},
  publisher    = {{Elsevier}},
  title        = {{{Learning Boolean Specifications}}},
  doi          = {{10.1016/j.artint.2015.09.003}},
  year         = {{2015}},
}