Skip to main content

Introducing abduction into (Extensional) inductive logic programming systems

  • Automated Reasoning
  • Conference paper
  • First Online:
AI*IA 97: Advances in Artificial Intelligence (AI*IA 1997)

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

Included in the following conference series:

Abstract

We propose an approach for the integration of abduction and induction in Logic Programming. In particular, we show how it is possible to learn an abductive logic program starting from an abductive background knowledge and a set of examples. By integrating Inductive Logic Programming with Abductive Logic Programming we can learn in presence of incomplete knowledge. Incomplete knowledge is handled by designating some pieces of information as abducibles, that is, possible hypotheses which can be assumed, provided that they are consistent with the current knowledge base. We then specialize the framework for FOIL, an ILP system adopting extensional coverage. In particular, we propose an extension of the FOIL algorithm that is able to learn from incomplete data.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. H. Adé and M. Denecker. RUTH: An ILP theory revision system. In Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems, 1994.

    Google Scholar 

  2. H. Adé and M. Denecker. AILP: Abductive inductive logic programming. In Proceedings of the 14th International Joint Conference on Artificial Intelligence, 1995.

    Google Scholar 

  3. F. Bergadano and D. Gunetti. Inductive Logic Programming. MIT press, 1996.

    Google Scholar 

  4. A. Brogi, E. Lamma, P. Mancarella, and P. Mello. An Abductive Framework for Extended Logic Programming. In Proceedings 3rd Int. Workshop on Logic Programming and Non Monotonic Reasoning, 1995.

    Google Scholar 

  5. Y. Dimopoulos and A. Kakas. Abduction and learning. In Advances in Inductive Logic Programming. IOS Press, 1996.

    Google Scholar 

  6. K. Eshghi and R.A. Kowalski. Abduction compared with Negation by Failure. In Proceedings of ICLP89, 1989.

    Google Scholar 

  7. F. Esposito, E. Lamma, D. Malerba, P. Mello, M. Milano, F. Riguzzi, and G. Semeraro. Learning abductive logic programs. In M. Denecker, L. De Raedt, P. Flach, and A. Kakas, editors, Proceedings of the ECAI96 Workshop on Abductive and Inductive Reasoning. Catholic University of Leuven, 1996.

    Google Scholar 

  8. N. Inuzuka, M. Kamo, N. Ishii, H. Seki, and H. Itoh. Top-down induction of logic programs from incomplete samples. In S. Muggleton, editor, Proceedings of the 6th International Workshop on Inductive Logic Programming, pages 119–136. Stockholm University, Royal Institute of Technology, 1996.

    Google Scholar 

  9. A.C. Kakas, R.A. Kowalski, and F. Toni. Abductive logic programming. Journal of Logic and Computation, 2:719–770, 1993.

    Google Scholar 

  10. A.C. Kalcas and P. Mancarella. On the relation between truth maintenance and abduction. In Proceedings of the 2nd Pacific Rim International Conference on Artificial Intelligence, 1990.

    Google Scholar 

  11. A.C. Kakas and F. Riguzzi. Learning with abduction. Technical Report TR-96-15, University of Cyprus, Computer Science Department, 1996.

    Google Scholar 

  12. R. Michalski, J.G. Carbonell, and T.M. Mitchell (eds). Machine Learning-An Artificial Intelligence Approach. Springer Verlag, 1984.

    Google Scholar 

  13. R. Michalski, J.G. Carbonell, and T.M. Mitchell (eds). Machine Learning-An Artificial Intelligence Approach Vol. II. Morgan Kaufmann, 1986.

    Google Scholar 

  14. D.L. Poole. A logical framework for default reasoning. Artificial Intelligence, 32, 1988.

    Google Scholar 

  15. J. R. Quinlan and R.M. Cameron-Jones. Induction of Logic Programs: FOIL and Related Systems. New Generation Computing, 13:287–312, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Maurizio Lenzerini

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lamma, E., Mello, P., Milano, M., Riguzzil, F. (1997). Introducing abduction into (Extensional) inductive logic programming systems. In: Lenzerini, M. (eds) AI*IA 97: Advances in Artificial Intelligence. AI*IA 1997. Lecture Notes in Computer Science, vol 1321. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63576-9_107

Download citation

  • DOI: https://doi.org/10.1007/3-540-63576-9_107

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63576-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics