Learnability of quantified formulas

Theoretical Computer Science

Volumn 306, Issue 1-3, 2003, Pages 485-511

  Dalmau, Víctor ^a   Jeavons, Peter ^b  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

Clones; Computational learning; Quantified formulas

Indexed keywords

ALGEBRA; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS;

COMPUTATIONAL LEARNING;

LEARNING SYSTEMS;

EID: 0042389768     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00342-6     Document Type: Article

References (32)

1. Angluin D. Queries and concept learning. Mach. Learn. 2:1988;319-342.
2. Angluin D., Frazier M., Pitt L. Learning conjunctions of Horn clauses. Mach. Learn. 9:1992;147-164.
3. Angluin D., Kharitonov M. When won't Membership Queries help. J. Comput. System Sci. 50:1995;336-355.
4. K.A. Baker, A.F. Pixley, Polynomial interpolation and the Chinese remainder theorem for algebraic systems, Math. Z. 143 (1975) 165-174.
5. N.H. Bshouty, Exact learning Boolean functions via the monotone theory, Inform. Comput. 123 (1995) 146-153.
6. Chen Z., Homer S. Learning counting functions with queries. Theoret. Comput. Sci. 180(1-2):1997;155-168.
7. Cohn P.M. Universal Algebra. 1965;Harper & Row, New York.
8. Cooper M.C., Cohen D.A., Jeavons P.G. Characterizing Tractable Constraints. Artificial Intelligence. 65:1994;347-361.
9. Dalmau V. A dichotomy theorem for learning quantified Boolean formulas. Mach. Learn. 35(3):1999;207-224.
10. Feder T., Vardi M.Y. The computational structure of monotone monadic SNP and constraint satisfaction. a study through Datalog and group theory SIAM J. Comput. 28(1):1998;57-104.
11. Helmbold D., Sloan R., Warmuth M. Learning nested differences of intersection-closed concept classes. Mach. Learn. 5(2):1990;165-196.
12. Hoffmann M.C. Group-Theoretic Algorithms and Graph Isomorphism. Lecture Notes in Computer Science. Vol. 136:1982;Springer, Berlin.
13. Jackson J.C. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. J. Comput. System Sci. 55(3):1997;414-440.
14. Jeavons P., Cohen D., Cooper M.C. Constraints, consistency and closure. Artificial Intelligence. 101:1998;251-265.
15. P. Jeavons, D. Cohen, M. Gyssens, A unifying framework for tractable constraints, in: 1st Internat. Conf. on Principles and Practice of Constraint Programming, CP'95, Cassis, France, September 1995, Lecture Notes in Computer Science, Vol. 976, Springer, Berlin, 1995, pp. 276-291.
16. Jeavons P., Cohen D., Gyssens M. Closure properties of constraints. J. ACM. 44(4):1997;527-548.
17. Jeavons P., Cooper M. Tractable constraints on ordered domains. Artificial Intelligence. 79:1996;327-339.
18. Kearns M., Valiant L. Cryptographic limitations on learning Boolean formulae and finite automata. J. ACM. 41(1):1994;67-95.
19. W. Maass, G. Turán, On learnability and predicate logic, in: Proc. of the 4th Bar-Ilan Symp. on Foundations of Artificial Intelligence, BISFAI'95, Jerusalem, 1995, pp. 75-85.
20. R.N. McKenzie, G.F. McNulty, W.F. Taylor, Algebras, Lattices and Varieties, Vol. 1, Wadsworth and Brooks, Monterey, Calif., 1987.
21. S. Muggleton (Ed.), Inductive Logic Programming, Academic Press, New York, 1992.
22. Muggleton S., De Raedt L. Inductive logic programming. theory and methods J. Logic Programming. 19/20(7):1994;629-679.
23. B.K. Natarajan, On learning Boolean functions, in: 9th Annu. ACM Symp. on Theory of Computing, STOC'87, New York, NY, 1987, pp. 296-304.
24. Pippenger N. Theory of Computability. 1997;Cambridge University Press, Cambridge.
25. Pitt L., Warmuth M. Prediction-preserving reducibility. J. Comput. System Sci. 41:1990;430-467.
26. Post E.L. The Two-Valued Iterative Systems of Mathematical Logic. Annals of Mathematics Studies. Vol. 5:1941;Princeton, NJ.
27. I.G. Rosenberg, Minimal clones I: the five types, in: Proc. Conf. Szeged 1983, Colloquia Mathematica Societatis Janos Bolyai, Vol. 43, Lectures in Universal Algebra, North-Holland, Amsterdam, 1986, pp. 405-427.
28. T.J. Schaefer, The complexity of satisfiability problems, in: 10th Annu. ACM Symp. on Theory of Computing, San Diego, Calif., 1978, pp. 216-226.
29. A. Szendrei, Clones in Universal Algebra, Seminaires de Mathématiques Supéreiores, Vol. 99, University of Montreal, 1986.
30. Szendrei A. Idempotent algebras with restrictions on subalgebras. Acta Sci. Math. 51:1987;251-268.
31. Valiant L. A theory of the learnable. Comm. ACM. 27(11):1984;1134-1142.
32. Yanov Yu.I., Muchnik A.A. On the existence of. k -valued closed classes without a finite basis Dokl. Akad. Nauk SSSR. 127:1959;44-46. (in Russian).