Advertisement

A New Algorithm for Learning Range Restricted Horn Expressions

Extended Abstract
  • Marta Arias
  • Roni Khardon
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1866)

Abstract

A learning algorithm for the class of range restricted Horn expressions is presented and proved correct. The algorithm works within the framework of learning from entailment, where the goal is to exactly identify some pre-fixed and unknown expression by making questions to membership and equivalence oracles. This class has been shown to be learnable in previous work. The main contribution of this paper is in presenting a more direct algorithm for the problem which yields an improvement in terms of the number of queries made to the oracles. The algorithm is also adapted to the class of Horn expressions with inequalities on all syntactically distinct terms where a significant improvement in the number of queries is obtained.

Keywords

Logic Program Minimisation Procedure Inductive Logic Programming Functional Term Target Expression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AK00a]
    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.Google Scholar
  2. [AK00b]
    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.Google Scholar
  3. [Ari97]
    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.Google Scholar
  4. [Coh95a]
    W. Cohen. PAC-learning recursive logic programs: Efficient algorithms. Journal of Artificial Intelligence Research, 2:501–539, 1995.zbMATHGoogle Scholar
  5. [Coh95b]
    W. Cohen. PAC-learning recursive logic programs: Negative results. Journal of Artificial Intelligence Research, 2:541–573, 1995.zbMATHGoogle Scholar
  6. [FP93]
    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.Google Scholar
  7. [Kha99a]
    R. Khardon. Learning function free Horn expressions. Machine Learning, 37:241–275, 1999.zbMATHCrossRefGoogle Scholar
  8. [Kha99b]
    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.Google Scholar
  9. [Kha00]
    Roni Khardon. Learning horn expressions with LOGAN-H. To appear in ICML, 2000.Google Scholar
  10. [Llo87]
    J.W. Lloyd. Foundations of Logic Programming. Springer Verlag, 1987.Google Scholar
  11. [MF92]
    S. Muggleton and C. Feng. Efficient induction of logic programs. In S. Muggleton, editor, Inductive Logic Programming, pages 281–298. Academic Press, 1992.Google Scholar
  12. [MR94]
    S. Muggleton and L. De Raedt. Inductive logic programming: Theory and methods. The Journal of Logic Programming, 19 & 20:629–680, May 1994.Google Scholar
  13. [Plo70]
    G. D. Plotkin. A note on inductive generalization. Machine Intelligence, 5:153–163, 1970.MathSciNetGoogle Scholar
  14. [RB92]
    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.Google Scholar
  15. [RS98]
    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.Google Scholar
  16. [RT98]
    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.Google Scholar
  17. [SEMF98]
    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.Google Scholar
  18. [Sha83]
    E. Y. Shapiro. Algorithmic Program Debugging. MIT Press, Cambridge, MA, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Marta Arias
    • 1
  • Roni Khardon
    • 1
  1. 1.Division of InformaticsUniversity of EdinburghEdinburghScotland

Personalised recommendations