Computing LP^MLN using ASP and MLN solvers

DOI10.1017/S1471068417000400MaRDI QIDQ4592718zbMATH OpenOpenAlexFDO

Authors Joohyung Lee, Samidh Talsania, Yi Wang

Publication date 8 November 2017

Published in Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1707.06325

zbMATH Keywords

answer set programmingLPMLNMarkov logic

Mathematics Subject Classification ID

Logic programming (68N17)

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, $extLPMLN2ASP$ and $extLPMLN2MLN$. System $extLPMLN2ASP$ translates LPMLN programs into the input language of answer set solver $extCLINGO$, and using weak constraints and stable model enumeration, it can compute most probable stable models as well as exact conditional and marginal probabilities. System $extLPMLN2MLN$ translates LPMLN programs into the input language of Markov Logic solvers, such as $extALCHEMY$, $extTUFFY$, and $extROCKIT$, 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. (Under consideration for acceptance in TPLP)

Recommendations

• scientific article; zbMATH DE number 7047283
• On the strong equivalences for \(\mathrm{LP^{MLN}}\) programs
• Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds
• Approximate Inference for Logic Programs with Annotated Disjunctions
• Lifted variable elimination for probabilistic logic programming

Cites work

• A tool for probabilistic reasoning based on logic programming and first-order theories under stable model semantics
• scientific article; zbMATH DE number 1493045 (Why is no real title available?)
• scientific article; zbMATH DE number 7047283 (Why is no real title available?)
• Inference and learning in probabilistic logic programs using weighted Boolean formulas
• Markov logic networks
• Multi-criteria optimization in answer set programming
• Probabilistic reasoning with answer sets

Cited in

(9)

• Abduction with probabilistic logic programming under the distribution semantics
• Elaboration Tolerant Representation of Markov Decision Process via Decision-Theoretic Extension of Probabilistic Action Language +
• On the strong equivalences of \(\mathrm{LP}^\mathrm{MLN}\) programs
• Bridging commonsense reasoning and probabilistic planning via a probabilistic action language
• On the strong equivalences for \(\mathrm{LP^{MLN}}\) programs
• Statistical relational extension of answer set programming
• Generative Datalog and answer set programming (extended abstract)
• Aspmc: new frontiers of algebraic answer set counting
• Online learning probabilistic event calculus theories in answer set programming

This page was built for publication: Computing \(\mathrm{LP}^{\mathrm{MLN}}\) using ASP and MLN solvers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4592718)