Complexity parameters for first order classes

Machine Learning

Volumn 64, Issue 1-3, 2006, Pages 121-144

  Arias, Marta ^a   Khardon, Roni ^b  

^a Och Spine at New York Presbyterian Hospitals   (United States)

^b Tufts University   (United States)

Author keywords

First order logic; Inductive logic programming; Learning theory; Query learning; VC dimension

Indexed keywords

COMPUTATION THEORY; LEARNING SYSTEMS; LOGIC PROGRAMMING; MATHEMATICAL MODELS; PARAMETER ESTIMATION; QUERY LANGUAGES; SET THEORY;

FIRST-ORDER LOGIC; INDUCTIVE LOGIC PROGRAMMING (ILP); LEARNING THEORY; QUERY LEARNING; VC-DIMENSION;

LARGE SCALE SYSTEMS;

EID: 33748252825     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-006-8261-3     Document Type: Conference Paper

References (29)

1. Angluin, D. (1988). Queries and concept learning. Machine Learning, 2(4), 319-342.
2. Arias, M., & Khardon, R. (2002). Learning closed horn expressions. Information and Computation, 178, 214-240.
3. Arias, M., Khardon, R., & Servedio, R. A. (2003). Polynomial certificates for prepositional classes. In: Proceedings of the Conference on Computational Learning Theory (pp. 537-551). Springer-Verlag.
4. Arimura, H. (1997). Learning acyclic first-order horn sentences from entailment. In: Proceedings of the International Conference on Algorithmic Learning Theory. Springer-Verlag.
5. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989). Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36(4), 929-965.
6. Cohen, W. (1995). PAC-learning recursive logic programs: Efficient algorithms. Journal of Artificial Intelligence Research, 2.
7. De Raedt, L. (1997). Logical settings for concept learning. Artificial Intelligence, 95(1), 187-201.
8. De Raedt, L., & Džeroski, S. (1994). First order jk-clausal theories are PAC-learnable. Artificial Intelligence, 70.
9. Džeroski, S., Muggleton, S., & Russell, S. (1992). PAC-learnability of determinate logic programs. In: D. Haussler (Ed.) Proceedings of the conference on computational learning theory, (pp. 128-135). Pittsburgh, PA: ACM Press.
10. Ehrenfeucht, A., Haussler, D., Kearns, M., & Valiant, L. (1989). A general lower bound on the number of examples needed for learning. Information and Computation, 82(3).
11. Frazier, M., & Pitt, L. (1993). Learning from entailment: An application to propositional horn sentences'. In: Proceedings of the International Conference on Machine Learning, (pp. 120-127). Amherst, MA: Morgan Kaufmann.
12. Gottlob, G. (1987). Subsumption and implication. Information Processing Letters, 24(2), 109-111.
13. Grohe, M., & Turán, G. (2002). Learnability and definability in trees and similar structures. In: Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science (STACS) (pp. 645-658). Springer-Verlag. LNCS 2285.
14. Hegedu′s, T. (1995) On generalized teaching dimensions and the query complexity of learning. In: Proceedings of the Conference on Computational Learning Theory, (pp. 108-117). New York, NY, USA: ACM Press.
15. Hellerstein, L., Pillaipakkamnatt, K., Raghavan, V., & Wilkins, D. (1996). How many queries are needed to learn? Journal of the ACM, 43(5), 840-862.
16. Horváth, T., & Turán, G. (2001). Learning logic programs with structured background knowledge. Artificial Intelligence, 128(1-2), 31-97.
17. Kearns, M., & Vazirani, U. (1994). An Introduction to computational learning theory. Cambridge: MIT Press.
18. Khardon, R. (1999a). Learning function free horn expressions. Machine Learning, 37.
19. Khardon, R. (1999b). Learning range restricted horn expressions. In: Proceedings of the Fourth European. Conference on Computational Learning Theory (pp. 111-125), Springer-Verlag.
20. Kietz, J. U., & Džeroski, S. (1994). Inductive logic programming and learnability. SIGART Bulletin, 5(1), 22-32.
21. Krishna Rao, M., & Sattar, A. (1998). Learning from entailment of logic programs with local variables. In: Proceedings of the International Conference on Algorithmic Learning Theory. Springer-Verlag.
22. Lloyd, J. W. (1987). Foundations of logic programming; (2nd extended ed.). Springer-Verlag.
23. Maass, W., & Turán, G. (1992). Lower bound methods and separation results for online learning models. Machine Learning, 9, 107-145.
24. Maass, W., & Turán, G. (1995). On learnability and predicate logic (extended abstract). In: Proceedings of the 4th Bar-Ilan Symposium on Foundations of AI (BISFAI).
25. Muggleton, S., & De Raedt, L. (1994). Inductive logic programming: Theory and methods. The Journal of Logic Programming, 19 & 20, 629-680.
26. Muggleton, S., & Feng, C. (1992). Efficient induction of logic programs. In: S. Muggleton (Ed.) Inductive logic programming, (pp. 281-298) Academic Press.
27. Reddy, C., & Tadepalli, P. (1997). Learning horn definitions with equivalence and membership queries. In: International Workshop on Inductive Logic Programming. (pp. 243-255). Prague, Czech Republic: Springer-Verlag.
28. Reddy, C., & Tadepalli, P. (1998). Learning first order acyclic horn programs from entailment. In: International Conference on Inductive Logic Programming. (pp. 23-37), Madison, WI: Springer-Verlag.
29. Vapnik, V., & Chervonenkis, A. (1971). On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2), 264-280.