Skip to main content
SpringerLink
Log in

Learning Logic Programs with Annotated Disjunctions

  • Conference paper
Inductive Logic Programming (ILP 2004)

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

Included in the following conference series:

Abstract

Logic Programs with Annotated Disjunctions (LPADs) provide a simple and elegant framework for integrating probabilistic reasoning and logic programming. In this paper we propose an algorithm for learning LPADs. The learning problem we consider consists in starting from a sets of interpretations annotated with their probability and finding one (or more) LPAD that assign to each interpretation the associated probability. The learning algorithm first finds all the disjunctive clauses that are true in all interpretations, then it assigns to each disjunct in the head a probability and finally decides how to combine the clauses to form an LPAD by solving a constraint satisfaction problem. We show that the learning algorithm is correct and complete.

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.

References

  1. Blockeel ,H.:Prolog for first-order bayesian networks: A meta-intepreter approach. In: Multi-Relational Data Mining, MRDM03 (2003)

    Google Scholar 

  2. Clark, K.L.: Negation as failure. In: Logic and Databases, Plenum Press, New York (1978)

    Google Scholar 

  3. Cussens, J.: Stochastic logic programs: Sampling, inference and applications. In: Sixteenth Annual Conference on Uncertainty in Artificial Intelligence (UAI 2000), pp. 115–122. Morgan Kaufmann, San Francisco (2000)

    Google Scholar 

  4. De Raedt, L., Dehaspe, L.: Clausal discovery. Machine Learning 26(2–3), 99–146 (1997)

    Article  MATH  Google Scholar 

  5. Fitting, M.: A kripke-kleene semantics for logic programs. Journal of Logic Programming 2(4), 295–312 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K.A. (eds.) Proceedings of the 5th Int. Conf. on Logic Programming, pp. 1070–1080. MIT Press, Cambridge (1988)

    Google Scholar 

  7. Getoor, L., Friedman, N., Koller, D., Pfeffer, A.: Learning probabilistic relational models. In: Dzeroski, S., Lavrac, N. (eds.) Relational Data Mining, Springer, Berlin (2001)

    Google Scholar 

  8. Holzbaur, C.: OFAI clp(q,r) manual, edition 1.3.3. Technical Report TR-95-09, Austrian Research Institute for Artificial Intelligence, Vienna (1995)

    Google Scholar 

  9. Kersting, K., De Raedt, L.: Bayesian logic programs. In: Work-in-Progress Reports of the Tenth International Conference on Inductive Logic Programming (ILP2000), London, UK (2000)

    Google Scholar 

  10. Kersting, K., De Raedt, L.: Bayesian logic programs. Technical Report 151, Institute for Computer Science, University of Freiburg, Freiburg, Germany (April 2001)

    Google Scholar 

  11. Kersting, K., De Raedt, L.: Towards combining inductive logic programming and bayesian networks. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol. 2157, p. 118. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  12. Lobo, J., Minker, J., Rajasekar, A.: Foundations of Disjunctive Logic Programming. MIT Press, Cambridge (1992)

    Google Scholar 

  13. Muggleton, S.H.: Learning stochastic logic programs. Electronic Transactions in Artificial Intelligence 4(041) (2000)

    Google Scholar 

  14. Ng, R.T., Subrahmanian, V.S.: Probabilistic logic programming. Information and Computation 101(2), 150–201 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  15. Ngo, L., Haddaway, P.: Answering queries from context-sensitive probabilistic knowledge bases. Theoretical Computer Science 171(1–2), 147–177 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  16. Ngo Probabilistic, L.: disjunctive logic programming. In: Proceedings of the 12th Annual Conference on Uncertainty in Artificial Intelligence (UAI 1996), pp. 397–404. Morgan Kaufmann Publishers, San Francisco (1996)

    Google Scholar 

  17. Poole, D.: The Independent Choice Logic for modelling multiple agents under uncertainty. Artificial Intelligence 94(1–2), 7–56 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  18. Santos Costa, V., Page, D., Qazi, M., Cussens, J.: Clp(BN): Constraint logic programming for probabilistic knowledge. In:Uncertainty in Artificial Intelligence, UAI 2003 (2003)

    Google Scholar 

  19. Sato, T.: A statistical learning method for logic programs with distribution semantics. In: 12th International Conference on Logic Programming (ICLP 1995), pp. 715–729 (1995)

    Google Scholar 

  20. Van Gelder, K.A.: Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the ACM 38(3), 620–650 (1991)

    MATH  Google Scholar 

  21. Vennekens, J., Verbaeten, S.: Logic programs with annotated disjunctions. Technical Report CW386, K. U. Leuven (2003), http://www.cs.kuleuven.ac.be/~joost/techrep.ps

  22. Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: The 20th International Conference on Logic Programming, ICLP 2004 (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Ingegneria, Università di Ferrara, Via Saragat 1, 44100, Ferrara, Italy

    Fabrizio Riguzzi

Authors
  1. Fabrizio Riguzzi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculdade de Engenharia & LIAAD, Universidade do Porto, Portugal

    Rui Camacho

  2. Department of Computer Science, Penglais, Aberystwyth, Ceredigion, University of Wales, SY23 3DB, Wales, UK

    Ross King

  3. Dept. of Computer Science and Engineering & Centre for Health Informatics, University of New South Wales, Sydney

    Ashwin Srinivasan

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Riguzzi, F. (2004). Learning Logic Programs with Annotated Disjunctions. In: Camacho, R., King, R., Srinivasan, A. (eds) Inductive Logic Programming. ILP 2004. Lecture Notes in Computer Science(), vol 3194. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30109-7_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30109-7_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22941-4

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation