Skip to main content

Inductive Logic Programming in Answer Set Programming

  • Conference paper

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

Abstract

In this paper we discuss the design of an Inductive Logic Programming (ILP) system in Answer Set Programming (ASP) and more in general the problem of integrating the two. We show how to formalise the learning problem as an ASP program and provide details on how the optimisation features of modern solvers can be adapted to derive preferred hypotheses.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Corapi, D., Russo, A., Lupu, E.: Inductive logic programming as abductive search. In: Tec. Comm. of the 26th ICLP, Dagstuhl, Germany. LIPIcs, vol. 7, pp. 54–63 (2010)

    Google Scholar 

  2. Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.T.: Potassco: The potsdam answer set solving collection. AI Commun. 24(2), 107–124 (2011)

    MathSciNet  MATH  Google Scholar 

  3. Lloyd, J.W.: Foundations of logic programming. Springer-Verlag New York, Inc., New York (1984)

    Book  MATH  Google Scholar 

  4. Muggleton, S.: Inverse entailment and progol. New Gen. Comp. 13(3&4), 245–286 (1995)

    Article  Google Scholar 

  5. Perri, S., Scarcello, F., Leone, N.: Abductive logic programs with penalization: Semantics, complexity and implementation. TPLP 5(1-2), 123–159 (2005)

    MathSciNet  MATH  Google Scholar 

  6. Sakama, C.: Nonmonotonic Inductive Logic Programming. In: Eiter, T., Faber, W., Truszczyński, M. (eds.) LPNMR 2001. LNCS (LNAI), vol. 2173, pp. 62–80. Springer, Heidelberg (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Corapi, D., Russo, A., Lupu, E. (2012). Inductive Logic Programming in Answer Set Programming. In: Muggleton, S.H., Tamaddoni-Nezhad, A., Lisi, F.A. (eds) Inductive Logic Programming. ILP 2011. Lecture Notes in Computer Science(), vol 7207. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31951-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31951-8_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31950-1

  • Online ISBN: 978-3-642-31951-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics