A new algorithm for learning range restricted horn expressions

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1866, Issue , 2000, Pages 21-39

  Arias, Marta ^a   Khardon, Roni ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER CIRCUITS; INDUCTIVE LOGIC PROGRAMMING (ILP); RECONFIGURABLE HARDWARE;

DIRECT ALGORITHMS; LEARNING FROM ENTAILMENTS;

LEARNING ALGORITHMS;

EID: 84954442536     PISSN: 03029743     EISSN: 16113349     Source Type: Journal    
DOI: 10.1007/3-540-44960-4_2     Document Type: Article

References (18)

1. M. Arias and R. Khardon. Learning Inequated Range Restricted Horn Expressions. Technical Report EDI-INF-RR-0011, Division of Informatics, University of Edinburgh, March 2000.
2. M. Arias and R. Khardon. A New Algorithm for Learning Range Restricted Horn Expressions. Technical Report EDI-INF-RR-0010, Division of Informatics, University of Edinburgh, March 2000.
3. Hiroki Arimura. Learning acyclic first-order Horn sentences from entailment. In Proceedings of the International Conference on ALT, Sendai, Japan, 1997. Springer-Verlag. LNAI 1316.
4. W. Cohen. PAC-learning recursive logic programs: Efficient algorithms. Journal of Artificial Intelligence Research, 2:501-539, 1995.
5. W. Cohen. PAC-learning recursive logic programs: Negative results. Journal of Artificial Intelligence Research, 2:541-573, 1995.
6. M. Frazier and L. Pitt. Learning from entailment: An application to propositional Horn sentences. In Proceedings of the International Conference on Machine Learning, pages 120-127, Amherst, MA, 1993. Morgan Kaufmann.
7. R. Khardon. Learning function free Horn expressions. Machine Learning, 37:241-275, 1999.
8. R. Khardon. Learning range restricted Horn expressions. In Proceedings of the Fourth European Conference on Computational Learning Theory, pages 111-125, Nordkirchen, Germany, 1999. Springer-verlag. LNAI 1572.
9. Roni Khardon. Learning horn expressions with LOGAN-H. To appear in ICML, 2000.
10. J. W. Lloyd. Foundations of Logic Programming. Springer Verlag, 1987.
11. S. Muggleton and C. Feng. Efficient induction of logic programs. In S. Muggleton, editor, Inductive Logic Programming, pages 281-298. Academic Press, 1992.
12. S. Muggleton and L. De Raedt. Inductive logic programming: Theory and methods. The Journal of Logic Programming, 19 & 20:629-680, May 1994.
13. G. D. Plotkin. A note on inductive generalization. Machine Intelligence, 5:153-163, 1970.
14. L. De Raedt and M. Bruynooghe. An overview of the interactive conceptlearner and theory revisor CLINT. In S. Muggleton, editor, Inductive Logic Programming, pages 163-192. Academic Press, 1992.
15. K. Rao and A. Sattar. Learning from entailment of logic programs with local variables. In Proceedings of the International Conference on Algorithmic Learning Theory, Otzenhausen, Germany, 1998. Springer-verlag. LNAI 1501.
16. C. Reddy and P. Tadepalli. Learning first order acyclic Horn programs from entailment. In International Conference on Inductive Logic Programming, pages 23-37, Madison, WI, 1998. Springer. LNAI 1446.
17. G. Semeraro, F. Esposito, D. Malerba, and N. Fanizzi. 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). Springer-Verlag, 1998. LNAI 1463.
18. E. Y. Shapiro. Algorithmic Program Debugging. MIT Press, Cambridge, MA, 1983.