Computing <i>LP^MLN</i> using ASP and MLN solvers

Abstract

Abstract LP MLN 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 LP MLN , lpmln 2 asp and lpmln 2 mln . System lpmln 2 asp translates LP MLN 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 lpmln 2 mln translates LP MLN programs into the input language of Markov Logic solvers, such as alchemy , tuffy , and rockit , and allows for performing approximate probabilistic inference on LP MLN programs. We also demonstrate the usefulness of the LP MLN systems for computing other languages, such as ProbLog and Pearl's Causal Models, that are shown to be translatable into LP MLN .