Skip to main content
SpringerLink
Log in

Inductive logic programming beyond logical implication

  • Conference paper
  • First Online:
Algorithmic Learning Theory (ALT 1996)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1160))

Included in the following conference series:

  • 171 Accesses

Abstract

This paper discusses the generalization of definite Horn programs beyond the ordering of logical implication. Since the seminal paper on generalization of clauses based on θ subsumption, there are various extensions in this area. Especially in inductive logic programming(ILP), people are using various methods that approximate logical implication, such as inverse resolution(IR), relative least general generalization(RLGG), and inverse implication(II), to generalize clauses. However, a program is more general than another program does not necessarily mean that the former should logically imply the latter. At least in the context of inductive synthesis of logic programs, we observe that the set inclusion ordering on the success set of logic programs is a more useful notion of generalization.

In this paper, we first define an ordering between logic programs which is strictly weaker than the implication ordering. Based on this ordering, we present a set of generalization rules borrowed from unfold/fold program transformation method and ILP. We also give some strategies to apply those rules.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aha, D.W., Lapointe, S., Ling, C.X. and Matwin, S., Learning recursive relations with randomly selected small training sets. In Proceedings of the Eleventh International Machine Learning Conference (pp. 12–18. New Brunswick, NJ: Morgan Kaufmann. 1994. (NCARAI TR: AIC-94-024).

    Google Scholar 

  2. Buntine, W., generalized subsumption and its applications to induction and redundancy, Artificial Intelligence, 36(2):149–176, 1988.

    Article  Google Scholar 

  3. Cypher,A. Ed., Watch What I Do: Programming by Demonstration, The MIT Press, 1993.

    Google Scholar 

  4. Cohen,W.W. and Page Jr.,C.D., Polynomial Learnability and Inductive Logic Programming: Methods and Results, New Generation Computing, Ohmsha LTD. and Springer-Verlag, 13, 369–409, 1995.

    Google Scholar 

  5. De Raedt, L. and Dzeroski, S., First-order jk-clausal theories are PAC-learnable, Artificial Intelligence, 70, 375–392, 1994.

    Article  Google Scholar 

  6. DeJong, G. and Mooney, R.. Explanation-based generalization: an alternative view, Machine Learning, 1, 145–176, 1986.

    Google Scholar 

  7. Furukawa,K., Imai,M. and Goebel,R., Hyper least general generalization and its application to higher-order concept learning, draft.

    Google Scholar 

  8. Hagiya,M., Programming by example and proving by example using higherorder unification, 10th Conference on Automated Deduction (M. E. Stickel ed.), Lecture Notes in Artificial Intelligence, Vol. 448, 1990, pp.588–602.

    Google Scholar 

  9. Idestam-Almquist,P., Generalization of Horn clauses, PhD Dissertation, Department of Computer Science and Systems Science, Stockholm University and the Royal Institute of Technology, 1993.

    Google Scholar 

  10. Idestam-Almquist, P., Efficient Induction of Recursive Definitions by Structural Analysis of Saturations, in Proceedings of the Fifth Workshop on Inductive Logic Programming (ILP95), Department of Computer Science, Katholieke Universiteit Leuven, Belgium, 1995.

    Google Scholar 

  11. Lapointe,S., Ling,C. and Matwin,S., Constructive Inductive Logic Programming, Proceedings of The Third International Workshop on Inductive Logic Programming ILP'93 April 1–3, 1993 Bled, Slovenia. 255–264.

    Google Scholar 

  12. Lloyd, J.W., Foundations of logic programming, Springer-Verlag, 1984.

    Google Scholar 

  13. Muggleton, S. and Buntine W., Machine invention of first-order predicates by inverting resolution. In S. Muggleton, editor, Inductive Logic Programming, London, 1992. Academic Press.

    Google Scholar 

  14. Maher, M.J., Equivalence of logic programs, Foundations of Deductive Databases and Logic Programming, Morgan Kaufmann, 1988.

    Google Scholar 

  15. Muggleton, S. and Feng, C., Efficient induction of logic programs. In Proceedings of the First Conference on Algorithmic Learning Theory, Tokyo., 1990. Ohmsha.

    Google Scholar 

  16. Marcinkowski,J. and Pacholski,L., Undecidability of the Horn clause implication problem. Proceedings of the 33 Annual IEEE Symposium on Foundations of Computer Science, Pittsburgh, 1992. 354–362.

    Google Scholar 

  17. Muggleton, S. and De Raedt, L., Inductive logic programming: theory and methods. Journal of Logic Programming, 19, 20:629–679, 1994.

    Article  Google Scholar 

  18. Muggleton,S., Inverting the resolution principle. In Machine Intelligence 12. Oxford University Press, 1991.

    Google Scholar 

  19. Miller,D., A logic programming language with lambda-abstraction, function variables, and simple unification, in Proceedings of the international workshop on Extensions of logic programming, Tubingen 1989. LCNS 475.

    Google Scholar 

  20. Niblett,T., A study of generalization in logic programs, In Proceedings of the third European working session on learning, Pitman, 1988.

    Google Scholar 

  21. Numao,M., Maruoka,T. and Shimura, M., Inductively Speeding Up Logic Programs, Machine Intelligence 13, Oxford University Press 1994, pp. 371–385.

    Google Scholar 

  22. Plotkin, G.D., A note on inductive generalization, Machine Intelligence 5, Edinburgh University Press 1970, pp. 153–163.

    Google Scholar 

  23. Plotkin, G.D., A further note on inductive generalization, Machine Intelligence 6, Edinburgh University Press 1971, pp. 101–124.

    Google Scholar 

  24. Pettorossi, A. and Proietti, M., Transformation of logic programs: foundations and techniques, J. Logic programming, 1994, 19(20), pp. 261–320.

    Google Scholar 

  25. Rouveirol, C., Flattening and saturation: two representation changes for generalization, Machine learning 14, pp. 219–232, 1994.

    Article  Google Scholar 

  26. Rouveirol, C., Puget,J.F., Beyond inversion of resolution, in Bruce W. Porter and Ray J. Mooney(eds.) Machine learning: Proceedings of the seventh international conference on machine learning, 1990. Morgan Kaufmann. pp. 122–130.

    Google Scholar 

  27. Tamaki,H., Sato,T., Unfold/fold transformation of logic programs, in: S. A. Tarnlund (ed.), Proceedings of the 2nd international conference on logic programming, Uppsala, Sweden, 1984, pp. 127–138.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Social Information Science, Fujitsu Laboratories Ltd., 140, Miyamoto, Numazu-shi, 410-03, Shizuoka, Japan

    Jianguo Lu & Jun Arima

  2. Department of Computer Science, Fudan University, 200433, Shanghai, P. R. China

    Jianguo Lu

Authors
  1. Jianguo Lu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jun Arima
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Setsuo Arikawa Arun K. Sharma

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lu, J., Arima, J. (1996). Inductive logic programming beyond logical implication. In: Arikawa, S., Sharma, A.K. (eds) Algorithmic Learning Theory. ALT 1996. Lecture Notes in Computer Science, vol 1160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61863-5_46

Download citation

  • DOI: https://doi.org/10.1007/3-540-61863-5_46

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61863-8

  • Online ISBN: 978-3-540-70719-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation