Query Learning and Certificates in Lattices
Abstract
We provide an abstract version, in terms of lattices, of the Horn query learning algorithm of Angluin, Frazier, and Pitt. To validate it, we develop a proof that is independent of the propositional Horn logic structure. We also construct a certificate set for the class of lattices that generalizes and improves an earlier certificate construction and that relates very clearly with the new proof.
Cite
Text
Arias and Balcázar. "Query Learning and Certificates in Lattices." International Conference on Algorithmic Learning Theory, 2008. doi:10.1007/978-3-540-87987-9_26Markdown
[Arias and Balcázar. "Query Learning and Certificates in Lattices." International Conference on Algorithmic Learning Theory, 2008.](https://mlanthology.org/alt/2008/arias2008alt-query/) doi:10.1007/978-3-540-87987-9_26BibTeX
@inproceedings{arias2008alt-query,
title = {{Query Learning and Certificates in Lattices}},
author = {Arias, Marta and Balcázar, José L.},
booktitle = {International Conference on Algorithmic Learning Theory},
year = {2008},
pages = {303-315},
doi = {10.1007/978-3-540-87987-9_26},
url = {https://mlanthology.org/alt/2008/arias2008alt-query/}
}