Learning Boolean read-once formulas over generalized bases

Journal of Computer and System Sciences

Volumn 50, Issue 3, 1995, Pages 521-542

  Bshouty, Nader H ^a   Hancock, Thomas R ^b   Hellerstein, Lisa ^c  

^a UNIVERSITY OF CALGARY   (Canada)

^b SIEMENS CORPORATE RESEARCH   (United States)

^c NORTHWESTERN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0029326814     PISSN: 00220000     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcss.1995.1042     Document Type: Article

References (18)

1. H. Aizenstein and L. Pitt, Exact learning of read-twice DNF formulas, in “32nd Annual Symposium on Foundations of Computer Science, October 1991, ” pp. 170-179.
2. D. Angluin, Learning regular sets from queries and counterexamples, Inform, and Comput. 75 (1987), 87-106.
3. D. Angluin, Queries and concept learning, Mach. Learning 2 (1988), 319-342.
4. D. Angluin, M. Frazier, and L. Pitt, Learning conjunctions of Horn clauses, in “31st Annual Symposium on Foundations of Computer Science, October 1990, ” pp. 186-192.
5. D. Angluin, L. Hellerstein, and M. Karpinski, Learning read-once formulas with queries, J. Assoc. Comput. Mach. 40 (1993), 185-210.
6. D. Angluin and M. Kharitonov, When won’t membership queries help?, in “Proceedings, Twenty Third Annual ACM Symposium on Theory of Computing, 1991, ” pp. 44-454.
7. A. Blum and S. Rudich, Fast learning of k-term DNF formulas with queries, in “Proceedings, Twenty Fourth Annual ACM Symposium on Theory of Computing, May 1992, ” pp. 382-389.
8. N. H. Bshouty, T. R. Hancock, and L. Hellerstein. Learning arithmetic read-once formulas, in “Proceedings, Twenty Fourth Annual ACM Symposium on Theory of Computing, 1992, ” pp. 370-38
9. N. H. BSHOUTY, T. R. HANCOCK, L. HELLERSTEIN, and M. KARPINSKI, “ Read-Once Threshold Formulas, Justifying Assignments, and Transformations, ” Technical report TR-92-020, International Computer Science Institute, 1991; Comput. Complexity, to appear.
10. T. R. Hancock, Identifying μ-formula decision trees with queries, in “Proceedings, Third Annual Workshop on Computational Learning Theory (COLT 90), 1990, " pp. 23-27.
11. T. R. Hancock, Learning 2μ DNF formulas and kμ decision trees, in “Proceedings, Fourth Annual Workshop on Computational Learning Theory (COLT 91), August 1991, ” pp. 199-209.
12. T. R. Hancock, M. Golea, and M. Marchand, “Learning Nonoverlapping Perceptron Networks from Examples and Membership Queries, " Technical Report TR-26-91, Harvard University, 1991; Mach. Learning, to appear.
13. T. R. Hancock and L. Hellerstein, Learning read-once formulas over fields and extended bases, in “Proceedings, Fourth Annual Workshop on Computational Learning Theory (COLT 91), 1991, ” pp. 326-336.
14. L. Hellerstein and C. Coullard, Learning binary matroid ports, in “Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1994."
15. N. Littlestone, Learning when irrelevant attributes abound: A new linear-threshold algorithm, Mach. Learning 2 (1988), 285-318.
16. K. Pillapakkamnat and V. Raghavan, "Read-Twice DNF Formulas are Properly Learnable.” (Revised) Technical Report TR-CS-93-59, Vanderbilt University, 1993.
17. V. Raghavan and S. R. Schach, Learning switch configurations, in “Proceedings, Third Annual Workshop on Computational Learning Theory (COLT 90), 1990, " pp. 38-51.
18. V. Raghavan and D. Wilkins, Learning p. branching programs with queries, in “Proceedings, Sixth Annual ACM Conference on Computational Learning Theory (COLT 93), 1993, ” pp. 27-36.