Skip to main content

Learning Logic Programs with Neural Networks

  • Conference paper
  • First Online:
Book cover Inductive Logic Programming (ILP 2001)

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

Included in the following conference series:

Abstract

First-order theory refinement using neural networks is still an open problem. Towards a solution to this problem, we use inductive logic programming techniques to introduce FOCA, a First-Order extension of the Cascade ARTMAP system. To present such a first-order extension of Cascade ARTMAP, we: a) modify the network structure to handle first-order objects; b) define first-order versions of the main functions that guide all Cascade ARTMAP dynamics, the choice and match functions; c) define a first-order version of the propositional learning algorithm to approximate Plotkin’s least general generalization. Preliminary results indicate that our initial goal of learning logic programs using neural networks can be achieved.

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 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. Basilio R., Zaverucha, G., and Garcez, A.: Inducing Relational Concepts with Neural Networks Via the LINUS System, In Proc. Fifth International Conference on Neural Information Processing (ICONIP’98), Vol. 3, Japan, 1998, pp. 1507–1510.

    Google Scholar 

  2. Botta M., Giordana A., and Piola, R.: FONN: Combining First Order Logic with Connectionist Learning. Proc. of the 14th International Conference on Machine Learning ICML-97, Morgan Kaufmann, 1997, pp. 46–56.

    Google Scholar 

  3. Bratko, I.: Refining Complete Hypotheses in ILP. ILP-99, LNAI 1634, Springer-Verlag, 1999, pp. 44–55

    Google Scholar 

  4. Carpenter, G. A., Grossberg, S., Reynolds, J.H., Markuzon, N., Rosen, D.B.: Fuzzy ARTMAP: A neural network architecture for incremental supervised learning of analog multidimensional maps. IEEE Trans. Neural Networks 3, 1992, pp. 698–713.

    Article  Google Scholar 

  5. Domingos, P.: Rule Induction and Instance-Based Learning: a Unified Approach, IJCAI, vol. 2, 1995, pp. 1226–1232.

    Google Scholar 

  6. Garcez, A. S., Zaverucha G.: The Connectionist Inductive Learning and Logic Programming System. Applied Intelligence Journal, F. Kurfess (editor), Vol. 11, Number 1, 1999, pp. 59–77.

    Google Scholar 

  7. Hallack, N. A., Zaverucha, G., and Barbosa, V. C.: Towards a hybrid model of first-order theory refinement. In Hybrid Neural Systems. LNAI 1778, Springer-Verlag, 2000.

    Google Scholar 

  8. Haussler, D.: Learning Conjunctive concepts in structural domains. Machine Learning 4, 1989, pp. 7–40.

    Google Scholar 

  9. Idestam-Almquist, P.: Efficient Induction of Recursive Definitions by Structural Analysis of Saturations. Advances in Inductive Logic Programming. Ed. Luc De Raedt, IOS Press, 1996, pp. 192–205.

    Google Scholar 

  10. Lavrac, N., and Dzeroski, S.: Inductive Logic Programming: Techniques and Applications. Ellis Horwood Series in Artificial Intelligence, 1994.

    Google Scholar 

  11. Mahoney, J.J., and Mooney, R. J.: Combining Connectionist and Symbolic Learning Methods to Refine Certainty-factor Rule-bases. Connection Science 5, 1993, pp. 339–364.

    Article  Google Scholar 

  12. Michie, D., Muggleton, S., Page, D., Srinivasan, A.: To the international computing community: a new East-West Challenge. Technical Report, Oxford University Computing Laboratory, Oxford, UK, 1994.

    Google Scholar 

  13. Muggleton, S., and Feng, C.: Efficient Induction of Logic Programs. In Muggleton, S. (Eds) Inductive Logic Programming, Academic Press, London, 1992, pp. 453–472.

    Google Scholar 

  14. Muggleton, S.: Inverse Entailment and Progol. In New Generation Computing 13, 1995, pp. 245–286.

    Article  Google Scholar 

  15. Muggleton, S.: Inductive logic programming: issues, results and the LLL challenge. Artificial Intelligence 114, pp. 283–296, December 1999, pp. 283–296.

    Google Scholar 

  16. Plotkin, G.: A further note on inductive generalization. Machine Intelligence, v. 6. University Press, 1971.

    Google Scholar 

  17. Quinlan, J. R.: Learning logical definitions from relations. Machine Learning 5, 1990, pp. 239–266.

    Google Scholar 

  18. Ramon, J. and Bruynooghe, M.: A framework for defining distances between first-order logic objects. ILP-98, LNAI 1446. Springer-Verlag, 1998, pp. 271–280.

    Google Scholar 

  19. Sebag, M. and Rouveirol, C.: Tractable Induction and Classification in First-Order Logic Via Stochastic Matching. Proc. of the 15th International Join Conference on Artificial Intelligence IJCAI-97, Morgan Kaufmann, 1997, pp. 888–892.

    Google Scholar 

  20. Shavlik, J.: Framework for Combining Symbolic and Neural Learning. Machine Learning 14, 1994, pp. 321–331.

    Google Scholar 

  21. Tan, Ah-Hwee: Cascade ARTMAP: Integrating Neural Computation and Symbolic Knowledge Processing. IEEE Trans.on Neural Networks vol. 8, n. 2, 1997, pp. 237–250.

    Article  Google Scholar 

  22. Towell, G., and Shavlik, J.: Knowledge-Based Artificial Neural Networks. Artificial Intelligence, vol. 70, 1994, pp. 119–165.

    Article  MATH  Google Scholar 

  23. Wrobel, S.: First Order Theory Refinement. Advances in Inductive Logic Programming. Ed. Luc De Raedt, IOS Press, 1996, pp. 14–33.

    Google Scholar 

  24. Kijsirikul, B. and Sinthupinyo, S.: Approximate ILP Rules by Backpropagation Neural Network: A Result on Thai Character Recognition. 9th International Workshop on Inductive Logic Programming, LNAI 1634, Springer-Verlag, 1999, pp. 162–173.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Basilio, R., Zaverucha, G., Barbosa, V.C. (2001). Learning Logic Programs with Neural Networks. In: Rouveirol, C., Sebag, M. (eds) Inductive Logic Programming. ILP 2001. Lecture Notes in Computer Science(), vol 2157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44797-0_2

Download citation

  • DOI: https://doi.org/10.1007/3-540-44797-0_2

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42538-0

  • Online ISBN: 978-3-540-44797-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics