Skip to main content
×
Home
    • Aa
    • Aa

Inference and learning in probabilistic logic programs using weighted Boolean formulas

  • DAAN FIERENS (a1), GUY VAN DEN BROECK (a1), JORIS RENKENS (a1), DIMITAR SHTERIONOV (a1), BERND GUTMANN (a1), INGO THON (a1), GERDA JANSSENS (a1) and LUC DE RAEDT (a1)...
Abstract
Abstract

Probabilistic logic programs are logic programs in which some of the facts are annotated with probabilities. This paper investigates how classical inference and learning tasks known from the graphical model community can be tackled for probabilistic logic programs. Several such tasks, such as computing the marginals, given evidence and learning from (partial) interpretations, have not really been addressed for probabilistic logic programs before. The first contribution of this paper is a suite of efficient algorithms for various inference tasks. It is based on the conversion of the program and the queries and evidence to a weighted Boolean formula. This allows us to reduce inference tasks to well-studied tasks, such as weighted model counting, which can be solved using state-of-the-art methods known from the graphical model and knowledge compilation literature. The second contribution is an algorithm for parameter estimation in the learning from interpretations setting. The algorithm employs expectation-maximization, and is built on top of the developed inference algorithms. The proposed approach is experimentally evaluated. The results show that the inference algorithms improve upon the state of the art in probabilistic logic programming, and that it is indeed possible to learn the parameters of a probabilistic logic program from interpretations.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Inference and learning in probabilistic logic programs using weighted Boolean formulas
      Available formats
      ×
      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Dropbox account. Find out more about sending content to Dropbox.

      Inference and learning in probabilistic logic programs using weighted Boolean formulas
      Available formats
      ×
      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your Google Drive account. Find out more about sending content to Google Drive.

      Inference and learning in probabilistic logic programs using weighted Boolean formulas
      Available formats
      ×
Copyright
Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

M. Chavira , A. Darwiche and M. Jaeger 2006. Compiling relational Bayesian networks for exact inference. International Journal of Approximate Reasoning 42, 1, 420.

A. Darwiche 2001. On the tractability of counting theory models and its application to belief revision and truth maintenance. Journal of Applied Non-Classical Logics 11, 1–2, 1134.

A. Darwiche 2009. Modeling and Reasoning with Bayesian Networks. Cambridge University Press, Cambridge, UK, Chap. 12.

M. Denecker , M. Bruynooghe and V. W. Marek 2001. Logic programming revisited: Logic programs as inductive definitions. ACM Transactions on Computational Logic 2, 4, 623654.

L. De Raedt 2008. Logical and Relational Learning. Cognitive Technologies. Springer, New York, NY.

L. De Raedt , P. Frasconi , K. Kersting and S. Muggleton , Eds. 2008. Probabilistic Inductive Logic Programming – Theory and Applications. LNCS, vol. 4911. Springer, New York, NY.

P. Domingos , S. Kok , D. Lowd , H. Poon , M. Richardson and P. Singla 2008. Probabilistic Inductive Logic Programming – Theory and Applications, Chapter “Markov Logic,” Lecture Notes in Computer Science. Springer, New York, NY.

B. Gutmann , A. Kimmig , K. Kersting and L. Raedt 2008a. Parameter learning in probabilistic databases: A least squares approach. In Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases (ECML PKDD '08) – Part I. Springer-Verlag, Berlin, Germany, 473488.

J. Lloyd 1987. Foundations of Logic Programming, 2nd edn.Springer-Verlag, Berlin, Germany.

N. Robertson and P. Seymour 1986. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms 7, 3, 309322.

A. Van Gelder , K. A. Ross and J. S. Schlipf 1991. The well-founded semantics for general logic programs. Journal of ACM 38, 3, 620650.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Theory and Practice of Logic Programming
  • ISSN: 1471-0684
  • EISSN: 1475-3081
  • URL: /core/journals/theory-and-practice-of-logic-programming
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Keywords:

Type Description Title
PDF
Supplementary Materials

Fierens Supplementary Material
Appendix

 PDF (470 KB)
470 KB

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 89 *
Loading metrics...

Abstract views

Total abstract views: 233 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 25th June 2017. This data will be updated every 24 hours.