Query Learning and Certificates in Lattices
Marta Arias and José L. Balcázar
Lecture Notes in Computer Science
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 certiﬁcate set for the class of lattices that generalizes and improves an earlier certiﬁcate construction and that relates very clearly with the new proof.
|Project Keyword:||Project Keyword UNSPECIFIED|
|Subjects:||Theory & Algorithms|
|Deposited By:||Marta Arias|
|Deposited On:||24 March 2009|