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. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Arias, M., & Balcázar, J. L. (2008). Query learning and certificates in lattices. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5254 LNAI, pp. 303–315). https://doi.org/10.1007/978-3-540-87987-9_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
