Skip to main content

Learning Inference by Induction

  • Conference paper
  • First Online:
Inductive Logic Programming (ILP 2015)

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

Included in the following conference series:

  • 520 Accesses

Abstract

This paper studies learning inference by induction. We first consider the problem of learning logical inference rules. Given a set S of propositional formulas and their logical consequences T, the goal is to find deductive inference rules that produce T from S. We show that an induction algorithm LF1T, which learns logic programs from interpretation transitions, successfully produces deductive inference rules from input transitions. Next we consider the problem of learning non-logical inference rules. We address three case studies for learning abductive inference, frame axioms and conversational implicature by induction. The current study provides a preliminary approach to the problem of learning inference to which little attention has been paid in machine learning and ILP.

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

Access this chapter

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 EPUB and 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

Notes

  1. 1.

    The result is shown for normal logic programs and is applied to their subclass of programs.

  2. 2.

    The experimental archive is found at http://www.wakayama-u.ac.jp/~sakama/ILP2015-short/.

  3. 3.

    An atom A occurring in b(R) is redundant if \(b(R)\setminus \{A\}\equiv _\theta b(R)\) where \(\equiv _\theta \) is equivalence under \(\theta \)-subsumption \(\le _\theta \), i.e., \(R_1\le _\theta R_2\) iff \(h(R_1\theta )=h(R_2)\) and \(b(R_1\theta )\subseteq b(R_2)\) for some substitution \(\theta \).

  4. 4.

    Here we assume the existence of a state constraint : \(\forall x\forall y\, [hold(on(x,t))\wedge hold(on(x,y))\rightarrow y=t\,]\) asserting that if an object x is on a table t and x is on y then y is t.

References

  1. Bengio, Y., Courville, A., Vincent, P.: Representation learning: a review and new perspectives. IEEE Trans. Pattern Anal. Mach. Intell. 35, 1798–1828 (2013)

    Article  Google Scholar 

  2. Coradeschi, S., Loutfi, A., Wrede, B.: A short review of symbol grounding in robotic and intelligent systems. KI - Kunstliche Intelligenz 27, 129–136 (2013)

    Article  Google Scholar 

  3. Grice, H.P.: Logic and conversation. In: Cole, P., Morgan, J. (eds.) Syntax and Semantics, 3: Speech Acts, pp. 41–58. Academic Press (1975)

    Google Scholar 

  4. Inoue, K., Furukawa, K., Kobayashi, I., Nabeshima, H.: Discovering rules by meta-level abduction. In: De Raedt, L. (ed.) ILP 2009. LNCS, vol. 5989, pp. 49–64. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Inoue, K., Ribeiro, T., Sakama, C.: Learning from interpretation transition. Mach. Learn. 94, 51–79 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  6. Levinson, S.C.: Pragmatics. Cambridge University Press, Cambridge (1983)

    Google Scholar 

  7. McCarthy, J., Hayes, P.J.: Some philosophical problems from the standpoint of artificial intelligence. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol. 4, pp. 463–502. Edinburgh University Press, Edinburgh (1969)

    Google Scholar 

  8. Muggleton, S.H., Lin, D., Pahlavi, N., Tamaddoni-Nezhad, A.: Meta-interpretive learning: application to grammatical inference. Mach. Learn. 94, 25–49 (2014)

    Article  MathSciNet  MATH  Google Scholar 

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

    MATH  Google Scholar 

  10. Peirce, C.S.: Collected papers of Charles Sanders Peirce. In: Hartshorne, C., Weiss, P., Burks, A. W. (eds.) Harvard University Press (1958)

    Google Scholar 

  11. Piaget, J.: Main Trends in Psychology. Allen & Unwin, London (1973)

    Google Scholar 

  12. Plotkin, G.D.: A note on inductive generalization. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence 5, pp. 153–63. Edinburgh University Press (1970)

    Google Scholar 

  13. Prawitz, D.: Natural Deduction: A Proof-Theoretical Study. Dover Publications, Mineola (2006)

    MATH  Google Scholar 

  14. Ribeiro, T., Inoue, K.: Learning prime implicant conditions from interpretation transition. In: Davis, J., et al. (eds.) ILP 2014. LNCS, vol. 9046, pp. 108–125. Springer, Heidelberg (2015). doi:10.1007/978-3-319-23708-4_8

    Chapter  Google Scholar 

  15. Sakama, C., Inoue, K.: Abduction and conversational implicature. 12th International Symposium on Logical Formalizations of Commonsense Reasoning, AAAI Spring Symposium, Technical report SS-15-04, pp. 130–133 (2015)

    Google Scholar 

  16. Sakama, C., Inoue, K.: Can machines learn logics? In: Bieger, J., Goertzel, B., Potapov, A. (eds.) AGI 2015. LNCS, vol. 9205, pp. 341–351. Springer, Heidelberg (2015)

    Chapter  Google Scholar 

  17. van Emden, M.H., Kowalski, R.A.: The semantics of predicate logic as a programming language. J. ACM 23, 733–742 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  18. Wong, W., Liu, W., Bennamoun, M.: Ontology learning from text: a look back and into the future. ACM Comput. Surv. 44, 20:1–20:36 (2012)

    Article  MATH  Google Scholar 

  19. Woods, J., Irvine, A., Walton, D.: Argument: Critical Thinking, Logic and the Fallacies. Prentice-Hall, Toronto (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chiaki Sakama .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Sakama, C., Ribeiro, T., Inoue, K. (2016). Learning Inference by Induction. In: Inoue, K., Ohwada, H., Yamamoto, A. (eds) Inductive Logic Programming. ILP 2015. Lecture Notes in Computer Science(), vol 9575. Springer, Cham. https://doi.org/10.1007/978-3-319-40566-7_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40566-7_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40565-0

  • Online ISBN: 978-3-319-40566-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics