Learning Boolean Specifications

U. Bubeck, H. Kleine Büning, Artificial Intelligence (2015) 246–257.

No fulltext has been uploaded.
Journal Article | English
Bubeck, Uwe; Kleine Büning, Hans
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.
Publishing Year
Journal Title
Artificial Intelligence
246 - 257

Cite this

Bubeck U, Kleine Büning H. Learning Boolean Specifications. Artificial Intelligence. 2015:246-257. doi:10.1016/j.artint.2015.09.003
Bubeck, U., & Kleine Büning, H. (2015). Learning Boolean Specifications. Artificial Intelligence, 246–257. https://doi.org/10.1016/j.artint.2015.09.003
@article{Bubeck_Kleine Büning_2015, title={Learning Boolean Specifications}, DOI={10.1016/j.artint.2015.09.003}, journal={Artificial Intelligence}, publisher={Elsevier}, author={Bubeck, Uwe and Kleine Büning, Hans}, year={2015}, pages={246–257} }
Bubeck, Uwe, and Hans Kleine Büning. “Learning Boolean Specifications.” Artificial Intelligence, 2015, 246–57. https://doi.org/10.1016/j.artint.2015.09.003.
U. Bubeck and H. Kleine Büning, “Learning Boolean Specifications,” Artificial Intelligence, pp. 246–257, 2015.
Bubeck, Uwe, and Hans Kleine Büning. “Learning Boolean Specifications.” Artificial Intelligence, Elsevier, 2015, pp. 246–57, doi:10.1016/j.artint.2015.09.003.


Marked Publications

Open Data LibreCat

Search this title in

Google Scholar