Skip to main content
SpringerLink
Log in

Inverse Entailment in Nonmonotonic Logic Programs

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

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

Included in the following conference series:

Abstract

Inverse entailment (IE) is known as a technique for finding inductive hypotheses in Horn theories. When a background theory is nonmonotonic, however, IE is not applicable in its present form. The purpose of this paper is extending the IE technique to nonmonotonic inductive logic programming (ILP). To this end, we first establish a new entailment theorem in normal logic programs, then introduce the notion of contrapositive programs. Finally, a theory of IE in nonmonotonic ILP is constructed.

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.

Similar content being viewed by others

References

  1. M. Bain and S. Muggleton. Non-monotonic learning. In: S. Muggleton (ed.) Inductive Logic Programming, Academic Press, pp. 145–161, 1992.

    Google Scholar 

  2. C. Baral and M. Gelfond. Logic programming and knowledge representation. Journal of Logic Programming 19/20:73–148, 1994.

    Article  MathSciNet  Google Scholar 

  3. F. Bergadano, D. Gunetti, M. Nicosia, and G. Ruffo. Learning logic programs with negation as failure. In: L. De Raedt (ed.) Advances in Inductive Logic Programming, IOS Press, pp. 107–123, 1996.

    Google Scholar 

  4. Y. Dimopoulos and A. Kakas. Learning nonmonotonic logic programs: learning exceptions. In: Proceedings of the 8th European Conference on Machine Learning, Lecture Notes in Artificial Intelligence 912, Springer-Verlag, pp. 122–137, 1995.

    Google Scholar 

  5. L. Fogel and G. Zaverucha. Normal programs and multiple predicate learning. In: Proceedings of the 8th International Workshop on Inductive Logic Programming, Lecture Notes in Artificial Intelligence 1446, Springer-Verlag, pp. 175–184, 1998.

    Google Scholar 

  6. M. Gelfond and V. Lifschitz. The stable model semantics for logic programming. In: Proceedings of the 5th International Conference and Symposium on Logic Programming, MIT Press, pp. 1070–1080, 1988.

    Google Scholar 

  7. K. Inoue and Y. Kudoh. Learning extended logic programs. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, pp. 176–181, 1997.

    Google Scholar 

  8. V. Lifschitz, L. R. Tang, and H. Turner. Nested expression in logic programs. Annals of Mathematics and Artificial Intelligence 25:369–389, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. W. Lloyd. Foundations of logic programming (2nd edition). Springer-Verlag, 1987.

    Google Scholar 

  10. L. Martin and C. Vrain. A three-valued framework for the induction of general logic programs. In: L. De Raedt (ed.) Advances in Inductive Logic Programming, IOS Press, pp. 219–235, 1996.

    Google Scholar 

  11. S. Muggleton. Inverse entailment and Progol. New Generation Computing 13:245–86, 1995.

    Article  Google Scholar 

  12. S. Muggleton. Completing inverse entailment. In: Proceedings of the 8th International Workshop on Inductive Logic Programming, Lecture Notes in Artificial Intelligence 1446, Springer-Verlag, pp. 245–249, 1998.

    Google Scholar 

  13. C. Sakama. Some properties of inverse resolution in normal logic programs. In: Proceedings of the 9th International Workshop on Inductive Logic Programming, Lecture Notes in Artificial Intelligence 1634, Springer-Verlag, pp. 279–290, 1999.

    Google Scholar 

  14. Y. Shoham. Nonmonotonic logics: meaning and utility. In: Proceedings of the 10th International Joint Conference on Artificial Intelligence, Morgan Kaufmann, pp. 388–393, 1987.

    Google Scholar 

  15. A. Yamamoto. Which hypotheses can be found with inverse entailment?In: Proceedings of the 7th International Workshop on Inductive Logic Programming, Lecture Notes in Artificial Intelligence 1297, Springer-Verlag, pp. 296–308, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Communication Sciences, Wakayama University Sakaedani, Wakayama, 640 8510, Japan

    Chiaki Sakama

Authors
  1. Chiaki Sakama
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of York, Heslington, York, YO10 5DD, UK

    James Cussens  & Alan Frisch  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakama, C. (2000). Inverse Entailment in Nonmonotonic Logic Programs. In: Cussens, J., Frisch, A. (eds) Inductive Logic Programming. ILP 2000. Lecture Notes in Computer Science(), vol 1866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44960-4_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-44960-4_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67795-6

  • Online ISBN: 978-3-540-44960-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation