Learning Sat-k-DNF formulas from membership queries

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 126-130

  Bergadano, F ^a   Catalano, D ^b   Varricchio, S ^c  

^a UNIVERSITY OF TURIN   (Italy)

^b UNIVERSITY OF CATANIA   (Italy)

^c UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION TREES; PROBABILITY DISTRIBUTIONS; COMPUTATION THEORY; LEARNING SYSTEMS; MEMBERSHIP FUNCTIONS; PROBABILITY; THEOREM PROVING; TREES (MATHEMATICS);

DNF FORMULAS; LEARNABILITY; MEMBERSHIP QUERY; REVERSAL-BOUNDED; TWO-WAY AUTOMATA; TWO-WAY FINITE AUTOMATA;

COMPUTATION THEORY; AUTOMATA THEORY;

AMBIGUOUS AUTOMATA; DECISION TREES; DNF FORMULAS; LEARNABILITY; MEMBERSHIP QUERIES; MULTIPLICITY;

EID: 0029725149     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/237814.237845     Document Type: Conference Paper

References (15)

1. D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87-106, 1987.
2. F. Bergadano and S. Varricchio. Learning Behaviors of Automata from Multiplicity and Equivalence Queries. SIAM J. Computing, to appear. Abstract available in LNCS 778, pages 54-62, 1994.
3. J. Berstel and C. Reutenauer. Rational series and their languages. Springer-Verlag, Berlin, 1988.
4. N. H. Bshouty. Exact Learning Boolean Functions via the Monotone Theory. In Proc. Symp. on the Foundations of Computer Science (FOCS), 1993.
5. N. H. Bshouty and Y. Mansour. Simple Learning Algorithms for Decision Trees and Multivariate Polynomials.
6. A. Ehrenfeucht and D. Haussler. Learning decision trees from random examples. Information and computation, 82:231-246, 1989.
7. S. Eilenberg. Automata Languages and Machines, Vol. A, Academic Press, New York, 1974.
8. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory Languages and Computation, Addison-Wesley, Reading, MA, 1979.
9. J. Jackson. An efficient membership query algorithm for learning DNF with respect to the uniform distribution. In Proc. Symp. on the Foundations of Computer Science (FOCS), 1994.
10. E. Kushilevitz and Y. Mansour. Learning Decision Trees using the Fourier Spectrum. SIAM J. Computing, 22(6):1331-1348, 1993.
11. B. K. Natarajan. Machine Learning. Morgan Kaufmann Publishers, inc.
12. L. Pitt and M. K. Warmuth. Prediction-preserving reducibility. Journal of Computer and System Science, 41(3):430-467, 1990.
13. A. Salomaa and M. Soittola. Automata theoretic aspects of formal power series. Springer-Verlag, New York, 1978.
14. R. E. Shapire, L. M. Sellie. Learning sparse multivariate polynomials over a field with queries and counterexamples. In Proceedings of the Sixth Annual ACM Workshop on Computational Learning Theory. July 1993.
15. L. G. Valiant. A theory of learnable. Communications of the ACM, 27(11):1134-1142, 1984.