Skip to main content
×
Home
    • Aa
    • Aa

Computing LPMLN using ASP and MLN solvers*

  • JOOHYUNG LEE (a1), SAMIDH TALSANIA (a1) and YI WANG (a1)
Abstract
Abstract

LPMLN is a recent addition to probabilistic logic programming languages. Its main idea is to overcome the rigid nature of the stable model semantics by assigning a weight to each rule in a way similar to Markov Logic is defined. We present two implementations of LPMLN, lpmln2asp and lpmln2mln. System lpmln2asp translates LPMLN programs into the input language of answer set solver clingo, and using weak constraints and stable model enumeration, it can compute most probable stable models as well as exact conditional and marginal probabilities. System lpmln2mln translates LPMLN programs into the input language of Markov Logic solvers, such as alchemy, tuffy, and rockit, and allows for performing approximate probabilistic inference on LPMLN programs. We also demonstrate the usefulness of the LPMLN systems for computing other languages, such as ProbLog and Pearl's Causal Models, that are shown to be translatable into LPMLN.

Copyright
Footnotes
Hide All
*

This work was partially supported by the National Science Foundation under Grants IIS-1319794 and IIS-1526301.

Footnotes
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

Lee et al supplementary material 1
Appendix

 PDF (599 KB)
599 KB

Metrics

Full text views

Total number of HTML views: 1
Total number of PDF views: 2 *
Loading metrics...

Abstract views

Total abstract views: 18 *
Loading metrics...

* Views captured on Cambridge Core between 30th August 2017 - 23rd September 2017. This data will be updated every 24 hours.