Query Learning and Certificates in Lattices

Authors:
M. Arias;J. L. Balcázar
Affiliations:
LARCA Research Group, Departament LSI, Universitat Politècnica de Catalunya,;LARCA Research Group, Departament LSI, Universitat Politècnica de Catalunya,
Venue:
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
Year:
2008

Citing 15
Cited 1

A theory of the learnable

Communications of the ACM
Learning regular sets from queries and counterexamples

Information and Computation
Negative Results for Equivalence Queries

Machine Learning
Learning Conjunctions of Horn Clauses

Machine Learning - Computational learning theory
Approximate inference of functional dependencies from relations

ICDT '92 Selected papers of the fourth international conference on Database theory
Generalized teaching dimensions and the query complexity of learning

COLT '95 Proceedings of the eighth annual conference on Computational learning theory
Knowledge compilation and theory approximation

Journal of the ACM (JACM)
Oracles and queries that are sufficient for exact learning

Journal of Computer and System Sciences
How many queries are needed to learn?

Journal of the ACM (JACM)
Classic learning

Machine Learning - Special issue on COLT '94
The consistency dimension and distribution-dependent learning from queries

Theoretical Computer Science
Queries revisited

Theoretical Computer Science - Special issue: Algorithmic learning theory
A general dimension for query learning

Journal of Computer and System Sciences
Toward mechanical mathematics

IBM Journal of Research and Development
Polynomial certificates for propositional classes

Information and Computation

On the gap between ess(f) and cnf_size(f)

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.