{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:01:18Z","timestamp":1747173678647,"version":"3.40.5"},"reference-count":18,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T00:00:00Z","timestamp":1689552000000},"content-version":"unspecified","delay-in-days":16,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2023,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A ProbLog program is a logic program with facts that only hold with a specified probability. In this contribution, we extend this ProbLog language by the ability to answer \u201cWhat if\u201d queries. Intuitively, a ProbLog program defines a distribution by solving a system of equations in terms of mutually independent predefined Boolean random variables. In the theory of causality, Judea Pearl proposes a counterfactual reasoning for such systems of equations. Based on Pearl\u2019s calculus, we provide a procedure for processing these counterfactual queries on ProbLog programs, together with a proof of correctness and a full implementation. Using the latter, we provide insights into the influence of different parameters on the scalability of inference. Finally, we also show that our approach is consistent with CP-logic, that is with the causal semantics for logic programs with annotated with disjunctions.<\/jats:p>","DOI":"10.1017\/s1471068423000133","type":"journal-article","created":{"date-parts":[[2023,7,17]],"date-time":"2023-07-17T10:28:43Z","timestamp":1689589723000},"page":"884-899","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":1,"title":["\u201cWhat if?\u201d in Probabilistic Logic Programming"],"prefix":"10.1017","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8866-3452","authenticated-orcid":false,"given":"RAFAEL","family":"KIESEL","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7891-6030","authenticated-orcid":false,"given":"KILIAN","family":"R\u00dcCKSCHLO\u00df","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3895-8279","authenticated-orcid":false,"given":"FELIX","family":"WEITK\u00c4MPER","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2023,7,17]]},"reference":[{"volume-title":"Causality","year":"2000","author":"Pearl","key":"S1471068423000133_ref10"},{"unstructured":"Balke, A. and Pearl, J. 1994. Probabilistic evaluation of counterfactual queries. In Proceedings of the Twelfth AAAI National Conference on Artificial Intelligence (AAAI 1994). AAAI Press, 230\u2013237.","key":"S1471068423000133_ref1"},{"doi-asserted-by":"publisher","key":"S1471068423000133_ref2","DOI":"10.1609\/aaai.v27i1.8690"},{"doi-asserted-by":"publisher","key":"S1471068423000133_ref8","DOI":"10.3389\/fnhum.2015.0042010.3389\/fnhum.2015.00420"},{"unstructured":"Korhonen, T. and J\u00e4rvisalo, M. 2021. Integrating tree decompositions into decision heuristics of propositional model counters (short paper). In 27th International Conference on Principles and Practice of Constraint Programming (CP 2021). LIPIcs, vol. 210. Schloss Dagstuhl, 8:1\u20138:11.","key":"S1471068423000133_ref9"},{"year":"2020","author":"Riguzzi","key":"S1471068423000133_ref12"},{"unstructured":"De Raedt, L. , Kimmig, A. and Toivonen, H. 2007. ProbLog: A probabilistic Prolog and its application in link discovery. In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), vol. 7. AAAI Press, 2462\u20132467.","key":"S1471068423000133_ref5"},{"doi-asserted-by":"publisher","key":"S1471068423000133_ref7","DOI":"10.1017\/S1471068414000076"},{"doi-asserted-by":"publisher","key":"S1471068423000133_ref16","DOI":"10.1007\/978-3-642-15675-5_27"},{"doi-asserted-by":"publisher","key":"S1471068423000133_ref17","DOI":"10.1017\/S1471068409003767"},{"doi-asserted-by":"publisher","key":"S1471068423000133_ref4","DOI":"10.1613\/jair.989"},{"doi-asserted-by":"crossref","unstructured":"Eiter, T. , Hecher, M. and Kiesel, R. 2021. Treewidth-aware cycle breaking for algebraic answer set counting. In Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning (KR 2021). IJCAI Organization, 269\u2013279.","key":"S1471068423000133_ref6","DOI":"10.24963\/kr.2021\/26"},{"doi-asserted-by":"publisher","key":"S1471068423000133_ref11","DOI":"10.1016\/0004-3702(93)90061-F"},{"unstructured":"Sato, T. 1995. A statistical learning method for logic programs with distribution semantics. In Logic Programming, Proceedings of the Twelfth International Conference on Logic Programming. MIT Press, 715\u2013729.","key":"S1471068423000133_ref15"},{"doi-asserted-by":"publisher","key":"S1471068423000133_ref13","DOI":"10.1017\/S147106841100010X"},{"unstructured":"R\u00fcckschlo\u00df, K. and Weitk\u00e4mper, F. 2022. Exploiting the full power of Pearl\u2019s causality in probabilistic logic programming. In Proceedings of the International Conference on Logic Programming 2022 Workshops (ICLP 2022). CEUR Workshop Proceedings, vol. 3193. CEUR-WS.org.","key":"S1471068423000133_ref14"},{"unstructured":"Darwiche, A. 2011. SDD: A new canonical representation of propositional knowledge bases. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011). IJCAI\/AAAI, 819\u2013826.","key":"S1471068423000133_ref3"},{"doi-asserted-by":"crossref","unstructured":"Vennekens, J. , Verbaeten, S. and Bruynooghe, M. 2004. Logic programs with annotated disjunctions. In Logic Programming. Springer, 431\u2013445.","key":"S1471068423000133_ref18","DOI":"10.1007\/978-3-540-27775-0_30"}],"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\/S1471068423000133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,27]],"date-time":"2024-02-27T09:38:43Z","timestamp":1709026723000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068423000133\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["S1471068423000133"],"URL":"https:\/\/doi.org\/10.1017\/s1471068423000133","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2023,7]]},"assertion":[{"value":"\u00a9 The Author(s), 2023. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}