Skip to main content
SpringerLink
Log in

Inductive Logic Programming: Yet Another Application of Logic

  • Conference paper
Declarative Programming for Knowledge Management (INAP 2005)

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

Abstract

This paper presents a brief introduction of the relation between logic programming and machine learning. The area researching the relation is usually called Inductive Logic Programming (ILP, for short). In this paper we will give the details of neither ILP systems nor ILP theories. We explain how to substitute concepts used in logic programming to items needed in formulating learning theories. We also show some theoretical applications to which the substitution are contributing.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akama, Y., Berardi, S., Hayashi, S., Kohlenbach, U.: An Arithmetical Hierarchy of the Law of Excluded Middle and Related Principles. In: Proc. of LICS 2004, pp. 192–201 (2004)

    Google Scholar 

  2. Angluin, D.: Inductive Inference of Formal Languages from Positive Data. Information and Control 45, 117–135 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  3. Angluin, D., Smith, C.H.: Inductive Inference: Theory and Methods. Computing Surveys 15, 237–269 (1983)

    Article  MathSciNet  Google Scholar 

  4. Arias, M., Khardon, R.: Learning Closed Horn Expressions. Information and Computation 178(1), 214–240 (2002)

    MATH  MathSciNet  Google Scholar 

  5. Arikawa, S., Miyano, S., Shinohara, A., Shinohara, T., Yamamoto, A.: Algorithmic Learning Theory with Elementary Formal Systems. IEICE Trans. Inf. & Syst. E75-D(4), 405–414 (1992)

    Google Scholar 

  6. Arimura, H.: Completeness of Depth-Bounded Resolution for Weakly Reducing Programs. In: Nakata, I., Hagiya, M. (eds.) Software Science and Engineering. World Scientific Series in Computer Science, vol. 31, pp. 227–245 (1991)

    Google Scholar 

  7. Arimura, H.: Learning Acyclic First-Order Horn Sentences from Entailment. In: Li, M. (ed.) ALT 1997. LNCS, vol. 1316, pp. 432–445. Springer, Heidelberg (1997)

    Google Scholar 

  8. Arimura, H., Shinohara, H., Otsuki, H., Ishizaka, H.: A Generalization of the Least General Generalization. Machine Intelligence 13, 59–85 (1994)

    Google Scholar 

  9. Arimura, H., Yamamoto, A.: Inductive Logic Programming: From Logic of Discovery to Machine Learning. IEICE Trans. Inf. and Syst. E83-D(1), 10–18 (2000)

    Google Scholar 

  10. De Brecht, M., Kobayashi, M., Tokunaga, H., Yamamoto, A.: Inferability of closed set systems from positive data. In: Washio, T., Satoh, K., Takeda, H., Inokuchi, A. (eds.) JSAI 2006. LNCS, vol. 4384, pp. 11–17. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  11. De Raedt, L., Kersting, K.: Probabilistic Inductive Logic Programming. In: Ben-David, S., Case, J., Maruoka, A. (eds.) ALT 2004. LNCS, vol. 3244, pp. 19–36. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  12. De Raedt, L., Džeroski, S.: First-order jk-clausal theories are PAC-learnable. Artificial Intelligence 70(1-2), 375–392 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  13. Džeroski, S., Lavrač, N.: Relational Data Mining. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  14. Gold, D.: Language Identfication in the Limit. Information and Control 10, 447–474 (1967)

    Article  MATH  Google Scholar 

  15. Gunopulos, D., Khardon, R., Mannila, H., Saluja, S., Toivonen, H., Sharma, R.S.: Discovering all most specific sentences. ACM Trans. Database Syst. 28(2), 140–174 (2003)

    Article  Google Scholar 

  16. Hayashi, S.: Mathematics Based on Learning. In: Cesa-Bianchi, N., Numao, M., Reischuk, R. (eds.) ALT 2002. LNCS, vol. 2533, pp. 7–21. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. Hayashi, S.: Can Proofs Be Animated By Games? In: Urzyczyn, P. (ed.) TLCA 2005. LNCS, vol. 3461, pp. 11–22. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  18. Jain, S., Osherson, D., Royer, J.S., Sharma, A.: Systems That Learn, 2nd edn. MIT Press, Cambridge (1999)

    Google Scholar 

  19. Khardon, R.: Learning Function-Free Horn Expressions. Machine Learning 37(3), 241–275 (1999)

    Article  MATH  Google Scholar 

  20. Kobayashi, M., Tokunaga, H., Yamamoto, A.: Ideals of Polynomial Rings and Learning from Positive Data (in Japanese). In: Proc. of IBIS 2005, pp. 129–134 (2005)

    Google Scholar 

  21. Laird, P.D.: Learning from Good and Bad Data. Kluwer Academic Publishers, Dordrecht (1988)

    MATH  Google Scholar 

  22. Lassez, J.-L., Maher, M.J., Marriott, K.: Unification Revisited. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, pp. 587–626. Morgan-Kaufman, San Francisco (1988)

    Google Scholar 

  23. Lloyd, J.W.: Logic for Learning: Learning Comprehensible Theories from Structured Data. Springer, Heidelberg (2003)

    MATH  Google Scholar 

  24. Martin, É., Nguyen, P., Sharma, A., Stephan, F.: Learning in Logic with RichProlog. In: Stuckey, P.J. (ed.) ICLP 2002. LNCS, vol. 2401, pp. 239–254. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  25. Miyano, S., Shinohara, A., Shinohara, T.: Polynomial-time Learning of Elementary Formal Systems. New Generation Computing 18(3), 217–242 (2000)

    Article  Google Scholar 

  26. Motoki, T., Shinohara, T., Wright, K.: The Correct Definition of Finite Elasticity: Corrigendum to Identification of Unions. In: Proc. of COLT 1991, vol. 375 (1991)

    Google Scholar 

  27. Muggleton, S.: Inverse Entailment and Progol. New Generation Computing 13, 245–286 (1995)

    Article  Google Scholar 

  28. Nakata, M., Hayashi, S.: A Limiting First Order Realizability Interpretation. Scientiae Mathematicae Japonicae 55(3), 567–580 (2002)

    MATH  MathSciNet  Google Scholar 

  29. Nienhuys-Cheng, S.-H., de Wolf, R.: Foundations of Inductive Logic Programming. LNCS, vol. 1228. Springer, Heidelberg (1997)

    Google Scholar 

  30. Plotkin, G.: A Note on Inductive Generalization. In: Machine Intelligence, vol. 5. Edinburgh University Press (1970)

    Google Scholar 

  31. Reynolds, J.C.: Transformational Systems and the Algebraic Structure of Atomic Formulas. Machine Intelligence 5, 135–152 (1970)

    MathSciNet  Google Scholar 

  32. Sakamoto, H., Hirata, K., Arimura, H.: Learning Elementary Formal Systems with Queries. Theoretical Computer Science 298(1), 21–50 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  33. Sato, T.: Parameterized Logic Programs where Computing Meets Learning. In: Kuchen, H., Ueda, K. (eds.) FLOPS 2001. LNCS, vol. 2024, pp. 40–60. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  34. Shapiro, E.Y.: Inductive Inference of Theories From Facts, Technical Report 192, Department of Computer Science, Yale University (1981); Also in Lassez, J.-L., Plotkin, G. (eds.) Computational Logic, pp. 199–254. The MIT Press (1991)

    Google Scholar 

  35. Shapiro, E.Y.: Alternation and the Computational Complexity of Logic Programs. The Journal of Logic Programming 1(1), 19–33 (1984)

    Article  MATH  Google Scholar 

  36. Stephan, F., Ventsov, Y.: Learning Algebraic Structures from Text. Theoretical Computer Science 268, 221–273 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  37. Ullman, J.D.: Princeples of Database and Knowledge-base Systems, vol. I, II. Computer Science Press (1988)

    Google Scholar 

  38. Wright, K.: Identification of Unions of Languages Drawn from an Identifiable Class. In: Proc. of COLT 1989, pp. 328–333 (1989)

    Google Scholar 

  39. Yamamoto, A., Ito, K., Ishino, A., Arimura, H.: Modelling Semi-structured Documents with Hedges for Deduction and Induction. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS, vol. 2157, pp. 240–247. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Informatics, Kyoto University, Yoshida-Honmachi, Sakyo-ku, Kyoto, 606-8501, Japan

    Akihiro Yamamoto

Authors
  1. Akihiro Yamamoto
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Graduate School of Computer Science and Systems Engineering, Kyushu Institute of Technology, Iizuka, Fukuoka, Japan

    Masanobu Umeda

  2. Fraunhofer FIRST, Kekuléstr. 7, D-12489, Berlin, Germany

    Armin Wolf

  3. IF Computer Japan, 5-28-2 Sendagi, Bunkyo-ku, 113-0022, Tokyo, Japan

    Oskar Bartenstein

  4. Fraunhofer FIRST, Berlin,  

    Ulrich Geske

  5. Universität Würzburg, Am Hubland, 97074, Würzburg, Germany

    Dietmar Seipel

  6. Graduate School of Computer Science and Systems Engineering,, Kyushu Institute of Technology, Iizuka, Fukuoka, Japan

    Osamu Takata

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yamamoto, A. (2006). Inductive Logic Programming: Yet Another Application of Logic. In: Umeda, M., Wolf, A., Bartenstein, O., Geske, U., Seipel, D., Takata, O. (eds) Declarative Programming for Knowledge Management. INAP 2005. Lecture Notes in Computer Science(), vol 4369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11963578_9

Download citation

  • DOI: https://doi.org/10.1007/11963578_9

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-69233-1

  • Online ISBN: 978-3-540-69234-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation