{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T08:47:18Z","timestamp":1770886038426,"version":"3.50.1"},"reference-count":14,"publisher":"Cambridge University Press (CUP)","issue":"5-6","license":[{"start":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T00:00:00Z","timestamp":1504051200000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2017,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>LP<jats:sup>MLN<\/jats:sup> 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<jats:sup>MLN<\/jats:sup>, <jats:sc>lpmln<\/jats:sc>2<jats:sc>asp<\/jats:sc> and <jats:sc>lpmln<\/jats:sc>2<jats:sc>mln<\/jats:sc>. System <jats:sc>lpmln<\/jats:sc>2<jats:sc>asp<\/jats:sc> translates LP<jats:sup>MLN<\/jats:sup> programs into the input language of answer set solver <jats:sc>clingo<\/jats:sc>, and using weak constraints and stable model enumeration, it can compute most probable stable models as well as exact conditional and marginal probabilities. System <jats:sc>lpmln<\/jats:sc>2<jats:sc>mln<\/jats:sc> translates LP<jats:sup>MLN<\/jats:sup> programs into the input language of Markov Logic solvers, such as <jats:sc>alchemy<\/jats:sc>, <jats:sc>tuffy<\/jats:sc>, and <jats:sc>rockit<\/jats:sc>, and allows for performing approximate probabilistic inference on LP<jats:sup>MLN<\/jats:sup> programs. We also demonstrate the usefulness of the LP<jats:sup>MLN<\/jats:sup> systems for computing other languages, such as ProbLog and Pearl's Causal Models, that are shown to be translatable into LP<jats:sup>MLN<\/jats:sup>.<\/jats:p>","DOI":"10.1017\/s1471068417000400","type":"journal-article","created":{"date-parts":[[2017,8,30]],"date-time":"2017-08-30T06:36:57Z","timestamp":1504075017000},"page":"942-960","source":"Crossref","is-referenced-by-count":24,"title":["Computing <i>LP<sup>MLN<\/sup><\/i> using ASP and MLN solvers"],"prefix":"10.1017","volume":"17","author":[{"given":"JOOHYUNG","family":"LEE","sequence":"first","affiliation":[]},{"given":"SAMIDH","family":"TALSANIA","sequence":"additional","affiliation":[]},{"given":"YI","family":"WANG","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2017,8,30]]},"reference":[{"key":"S1471068417000400_ref3","doi-asserted-by":"publisher","DOI":"10.1109\/69.877512"},{"key":"S1471068417000400_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-006-5833-1"},{"key":"S1471068417000400_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068414000076"},{"key":"S1471068417000400_ref10","unstructured":"Lee J. and Wang Y. 2016. Weighted rules under the stable model semantics. In Proc. of International Conference on Principles of Knowledge Representation and Reasoning (KR), 145\u2013154."},{"key":"S1471068417000400_ref9","doi-asserted-by":"crossref","unstructured":"Lee J. , Talsania S. and Wang Y. 2017. Online appendix for the paper \u201cComputing LPMLN using ASP and MLN solvers\u201d. TPLP Archive. https:\/\/doi.org\/10.1017\/S1471068417000400","DOI":"10.1017\/S1471068417000400"},{"key":"S1471068417000400_ref1","unstructured":"Balai E. and Gelfond M. 2016. On the relationship between P-log and LPMLN. In Proc. of International Joint Conference on Artificial Intelligence (IJCAI), 915\u2013921."},{"key":"S1471068417000400_ref7","unstructured":"Gebser M. , Kaminski R. , Kaufmann B. and Schaub T. 2011. Multi-criteria optimization in answer set programming. In LIPIcs-Leibniz International Proceedings in Informatics, vol. 11. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 1\u201310."},{"key":"S1471068417000400_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068408003645"},{"key":"S1471068417000400_ref13","volume-title":"Causality: Models, Reasoning and Inference","author":"Pearl","year":"2000"},{"key":"S1471068417000400_ref4","unstructured":"Calimeri F. , Faber W. , Gebser M. , Ianni G. , Kaminski R. , Krennwallner T. , Leone N. , Ricca F. and Schaub T. 2012. ASP-Core-2: Input language format. ASP Standardization Working Group, Technical Report."},{"key":"S1471068417000400_ref11","unstructured":"Lee J. and Yang Z. 2017. LPMLN, weak constraints, and P-log. In Proc. of the AAAI Conference on Artificial Intelligence (AAAI), 1170\u20131177."},{"key":"S1471068417000400_ref5","unstructured":"De Raedt L. , Kimmig A. and Toivonen H. 2007. ProbLog: A probabilistic prolog and its application in link discovery. In Proc. of IJCAI, vol. 7. 2462\u20132467."},{"key":"S1471068417000400_ref12","doi-asserted-by":"crossref","unstructured":"Nickles M. 2016. A tool for probabilistic reasoning based on logic programming and first-order theories under stable model semantics. In Proc. of European Conference on Logics in Artificial Intelligence (JELIA), 369\u2013384.","DOI":"10.1007\/978-3-319-48758-8_24"},{"key":"S1471068417000400_ref8","unstructured":"Lee J. , Meng Y. and Wang Y. 2015. Markov logic style weighted rules under the stable model semantics. In Technical Communications of the 31st International Conference on Logic Programming."}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068417000400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T01:51:03Z","timestamp":1555465863000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068417000400\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,30]]},"references-count":14,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["S1471068417000400"],"URL":"https:\/\/doi.org\/10.1017\/s1471068417000400","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,8,30]]}}}