Learning closed horn expressions

Information and Computation

Volumn 178, Issue 1, 2002, Pages 214-240

  Arias, Marta ^a   Khardon, Roni ^a  

^a TUFTS UNIVERSITY   (United States)

Author keywords

Algorithms; Computational learning theory; Horn expressions; Inductive logic programming; Queries

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOUNDARY CONDITIONS; LEARNING SYSTEMS; LOGIC PROGRAMMING; PROBLEM SOLVING;

HORN EXPRESSIONS; LEARNING FROM ENTAILMENT;

COMPUTATIONAL COMPLEXITY;

EID: 0037057856     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0890-5401(02)93162-7     Document Type: Article

References (23)

1. Arias, M., and Khardon, R. (2000), "Learning Inequated Range Restricted Horn Expressions," Technical Report EDI-INF-RR-0011, Division of Informatics, University of Edinburgh.
2. Arias, M., and Khardon, R. (2000), A new algorithm for learning range restricted Horn expressions, in "Proceedings of the 10th International Conference on Inductive Logic Programming," Lecture Notes in Artificial Intelligence, Vol. 1866, pp. 21-39, Springer-Verlag, Berlin.
3. Arimura, Hiroki (1997), Learning acyclic first-order Horn sentences from entailment, in "Proceedings of the International Conference on ALT, Sendai, Japan," Lecture Notes in Artificial Intelligence, Vol. 1316, Springer-Verlag, Berlin.
4. Cohen, W. (1995), PAC-learning recursive logic programs: Efficient algorithms, J. Artificial Intelligence Res. 2, 501-539.
5. Cohen, W. (1995), PAC-learning recursive logic programs: Negative results, J. Artificial Intelligence Res. 2, 541-573.
6. Fraizer, M., and Pitt, L. (1993), Learning from entailment: An application to propositional Horn sentences, in "Proceedings of the International Conference on Machine Learning, Amherst, MA," pp. 120-127, Morgan Kaufmann, San Mateo, CA.
7. Hegedus, T. (1995), On generalized teaching dimensions and the query complexity of learning, in "Proceedings of the 8th Annual Conference on Computational Learning Theory (COLT'95), New York, July," pp. 108-117, Assoc. Comput. Mach., New York.
8. Hellerstein, L., Phillaipakkamnatt, K., Raghavan, V., and Wilkins, D. (1996), How many queries are needed to learn? J. Assoc. Comput. Mach. 43(5), 840-862.
9. Page, C. D. Jr. (1993), "Anti-Unification in Constraint Logics: Foundations and Applications to Learnability in First-order Logic, to Speed-up Learning, and to Deduction," Technical Report UIUCDCS-R-93-1820, University of Illinois at Urbana-Champaign, Department of Computer Science.
10. Khardon, R. (1999), Learning function free Horn expressions, Mach. Learning 37, 241-275.
11. Khardon, R. (1999), Learning range restricted Horn expressions, in "Proceedings of the Fourth European Conference on Computational Learning Theory, Nordkirchen, Germany," Lecture Notes in Artificial Intelligence, Vol. 1572, pp. 111-125, Springer-Verlag, Berlin.
12. Khardon, Roni (2000), Learning Horn expressions with LogAn-H, in "Proceedings of the International Conference on Machine Learning," pp. 471-478.
13. Lloyd, J. W. (1997), "Foundations of Logic Programming," Springer-Verlag, Berlin.
14. Muggleton, S., and Feng, C. (1987), Efficient induction of logic programs, in "Inductive Logic Programming" (S. Muggleton, Ed.), pp. 281-298, Academic Press, New York.
15. Muggleton, S., and De Raedt, L. (1994), Inductive logic programming: Theory and methods, J. Logic Programming 19/20, 629-680.
16. Nienhuys-Cheng, S., and De Wolf, R. (1997), "Foundations of Inductive Logic Programming," Lecture Notes in Artificial Intelligence, Vol. 1228, Springer-Verlag, Berlin.
17. Plotkin, G. D. (1970), A note on inductive generalization, Mach. Intelligence 5, 153-163.
18. De Raedt, L., and Bruynooghe, M. (1992), An overview of the interactive concept-learner and theory revisor CLINT, in "Inductive Logic Programming" (S. Muggleton, Ed.), pp. 163-192, Academic Press, New York.
19. Rao, K., and Sattar, A. (1998), Learning from entailment of logic programs with local variables, in "Proceedings of the International Conference on Algorithmic Learning Theory, Otzenhausen, Germany," Lecture Notes in Artificial Intelligence, Vol. 1501, Springer-Verlag, Berlin.
20. Reddy, C., and Tadepalli, P. (1998), Learning first order acyclic Horn programs from entailment, in "International Conference on Inductive Logic Programming, Madison, WI," Lecture Notes in Artificial Intelligence, Vol. 1446, pp. 23-37, Springer-Verlag, Berlin.
21. Reddy, C., and Tadepalli, P. (1998), Learning Horn definitions: Theory and an application to planning, New Generation Computing 17, 77-98.
22. Semeraro, G., Esposito, F., Malerba, D., and Fanizzi, N. (1998), A logic framework for the incremental inductive synthesis of datalog theories, in "Proceedings of the International Conference on Logic Program Synthesis and Transformation (LOPSTR'97)," Lecture Notes in Artificial Intelligence, Vol. 1463, Springer-Verlag, Berlin.
23. Shapiro, E. Y. (1983), "Algorithmic Program Debugging," MIT Press, Cambridge, MA.