Query-Based Learning

[1]  José L. Balcázar,et al.  Canonical Horn Representations and Query Learning , 2009, ALT.

[2]  Sanjay Jain,et al.  A general comparison of language learning from examples and from queries , 2007, Theor. Comput. Sci..

[3]  Sandra Zilles,et al.  Relations between Gold-style learning and query learning , 2005, Inf. Comput..

[4]  Roni Khardon,et al.  Learning Closed Horn Expressions , 2002, Inf. Comput..

[5]  Dana Angluin,et al.  Queries revisited , 2001, Theor. Comput. Sci..

[6]  Hans Ulrich Simon,et al.  Learning deterministic finite automata from smallest counterexamples , 1998, SODA '98.

[7]  William I. Gasarch,et al.  Inferring answers to queries , 1997, COLT '97.

[8]  L. Hellerstein,et al.  How many queries are needed to learn? , 1996, STOC '95.

[9]  Jeffrey C. Jackson,et al.  An efficient membership-query algorithm for learning DNF with respect to the uniform distribution , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[10]  Marek Karpinski,et al.  Learning read-once formulas with queries , 1993, JACM.

[11]  Lisa Hellerstein,et al.  Read-thrice DNF is hard to learn with membership and equivalence queries , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[12]  Carl H. Smith,et al.  Learning via queries , 1992, JACM.

[13]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..