Query Learning and Certificates in Lattices
Marta Arias and José L. Balcázar
Lecture Notes in Computer Science Volume 5254, pp. 303-315, 2008. ISSN 0302-9743

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.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.

[Edit]