{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:01:17Z","timestamp":1747173677871,"version":"3.40.5"},"reference-count":59,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T00:00:00Z","timestamp":1684972800000},"content-version":"unspecified","delay-in-days":0,"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,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Argumentation problems are concerned with determining the acceptability of a set of arguments from their relational structure. When the available information is uncertain, probabilistic argumentation frameworks provide modeling tools to account for it. The first contribution of this paper is a novel interpretation of probabilistic argumentation frameworks as probabilistic logic programs. Probabilistic logic programs are logic programs in which some of the facts are annotated with probabilities. We show that the programs representing probabilistic argumentation frameworks do not satisfy a common assumption in probabilistic logic programming (PLP) semantics, which is, that probabilistic facts fully capture the uncertainty in the domain under investigation. The second contribution of this paper is then a novel PLP semantics for programs where a choice of probabilistic facts does not uniquely determine the truth assignment of the logical atoms. The third contribution of this paper is the implementation of a PLP system supporting this semantics: <jats:sc>sm<\/jats:sc>ProbLog. <jats:sc>sm<\/jats:sc>ProbLog is a novel PLP framework based on the PLP language ProbLog. <jats:sc>sm<\/jats:sc>ProbLog supports many inference and learning tasks typical of PLP, which, together with our first contribution, provide novel reasoning tools for probabilistic argumentation. We evaluate our approach with experiments analyzing the computational cost of the proposed algorithms and their application to a dataset of argumentation problems.<\/jats:p>","DOI":"10.1017\/s147106842300008x","type":"journal-article","created":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T09:12:07Z","timestamp":1685005927000},"page":"1198-1247","update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":3,"title":["<scp>sm<\/scp><i>ProbLog: Stable Model Semantics in ProbLog for Probabilistic Argumentation<\/i>"],"prefix":"10.1017","volume":"23","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5845-6914","authenticated-orcid":false,"given":"PIETRO","family":"TOTIS","sequence":"first","affiliation":[]},{"given":"LUC","family":"DE RAEDT","sequence":"additional","affiliation":[]},{"given":"ANGELIKA","family":"KIMMIG","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2023,5,25]]},"reference":[{"key":"S147106842300008X_ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78652-8"},{"key":"S147106842300008X_ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103236"},{"key":"S147106842300008X_ref50","doi-asserted-by":"crossref","unstructured":"Poole, D. 2008. The independent choice logic and beyond. See De Raedt et al. (2008), 222\u2013243.","DOI":"10.1007\/978-3-540-78652-8_8"},{"key":"S147106842300008X_ref39","unstructured":"Lee, J. and Wang, Y. 2016. Weighted rules under the stable model semantics. In Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, KR 2016, Cape Town, South Africa, April 25-29, 2016, C. Baral, J. P. Delgrande and F. Wolter, Eds. AAAI Press, 145\u2013154."},{"key":"S147106842300008X_ref21","doi-asserted-by":"publisher","DOI":"10.4064\/fm-17-1-298-329"},{"key":"S147106842300008X_ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00041-X"},{"key":"S147106842300008X_ref44","first-page":"254","article-title":"Stochastic logic programs","volume":"32","author":"Muggleton","year":"1996","journal-title":"Advances in inductive logic programming"},{"key":"S147106842300008X_ref48","unstructured":"Pearl, J. 1989. Probabilistic Reasoning in Intelligent Systems - Networks of Plausible Inference. Morgan Kaufmann Series in Representation and Reasoning. Morgan Kaufmann."},{"key":"S147106842300008X_ref35","unstructured":"Hunter, A. , Polberg, S. and Thimm, M. 2018. Epistemic graphs for representing and reasoning with positive and negative influences of arguments. CoRR abs\/1802.07489."},{"key":"S147106842300008X_ref41","unstructured":"Lukasiewicz, T. 1998. Probabilistic logic programming. In 13th European Conference on Artificial Intelligence, Brighton, UK, August 23-28 1998, Proceedings, H. Prade, Ed. Wiley, John and Sons, 388\u2013392."},{"key":"S147106842300008X_ref10","unstructured":"Bondarenko, A. , Toni, F. and Kowalski, R. A. 1993. An assumption-based framework for non-monotonic reasoning. In Logic Programming and Non-monotonic Reasoning, Proceedings of the Second International Workshop, Lisbon, Portugal, June 1993, L. M. Pereira and A. Nerode, Eds. MIT Press, 171\u2013189."},{"key":"S147106842300008X_ref57","unstructured":"Vennekens, J. 2013. Negation in the head of cp-logic rules. CoRR abs\/1312.6156."},{"key":"S147106842300008X_ref13","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1411"},{"key":"S147106842300008X_ref38","doi-asserted-by":"crossref","unstructured":"Koller, D. and Friedman, N. 2011. Probabilistic graphical models: Principles and techniques. MIT Press, 1231 pp., ISBN 0-262-01319-3, Knowledge Engineering Review 26, 2, 237\u2013238.","DOI":"10.1017\/S0269888910000275"},{"key":"S147106842300008X_ref15","doi-asserted-by":"crossref","unstructured":"Choi, A. , Kisa, D. and Darwiche, A. 2013. Compiling probabilistic graphical models using sentential decision diagrams. In Symbolic and Quantitative Approaches to Reasoning with Uncertainty - 12th European Conference, ECSQARU 2013, Utrecht, The Netherlands, July 8-10, 2013. Proceedings, L. C. van der Gaag, Ed. Lecture Notes in Computer Science, vol. 7958. Springer, 121\u2013132.","DOI":"10.1007\/978-3-642-39091-3_11"},{"key":"S147106842300008X_ref5","doi-asserted-by":"crossref","unstructured":"Azzolini, D. , Bellodi, E. and Riguzzi, F. 2022. Statistical statements in probabilistic logic programming. In Logic Programming and Nonmonotonic Reasoning - 16th International Conference, LPNMR 2022, Genova, Italy, September 5-9, 2022, Proceedings, G. Gottlob, D. Inclezan and M. Maratea, Eds. Lecture Notes in Computer Science, vol. 13416. Springer, 43\u201355.","DOI":"10.1007\/978-3-031-15707-3_4"},{"key":"S147106842300008X_ref43","doi-asserted-by":"crossref","unstructured":"Meert, W. and Vennekens, J. 2014. Inhibited effects in CP-logic. In Probabilistic Graphical Models - 7th European Workshop, PGM 2014, Utrecht, The Netherlands, September 17-19, 2014. Proceedings, L. C. van der Gaag and A. J. Feelders, Eds. Lecture Notes in Computer Science, vol. 8754. Springer, 350\u2013365.","DOI":"10.1007\/978-3-319-11433-0_23"},{"volume-title":"The MIT Press Essential Knowledge Series","year":"2014","author":"Nilsson","key":"S147106842300008X_ref47"},{"year":"2015","author":"Dries","key":"S147106842300008X_ref24"},{"key":"S147106842300008X_ref30","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"S147106842300008X_ref14","first-page":"50","article-title":"Bayesian networks without tears","volume":"12,","author":"Charniak","year":"1991","journal-title":"AI Magazine"},{"key":"S147106842300008X_ref28","doi-asserted-by":"crossref","unstructured":"Gelfond, M. 2008. Answer sets. In Handbook of Knowledge Representation, F. van Harmelen, V. Lifschitz and B. W. Porter, Eds. Foundations of Artificial Intelligence, vol. 3. Elsevier, 285\u2013316.","DOI":"10.1016\/S1574-6526(07)03007-6"},{"key":"S147106842300008X_ref3","unstructured":"Amgoud, L. , Cayrol, C. and Lagasquie-Schiex, M. 2004. On the bipolarity in argumentation frameworks. In 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), Whistler, Canada, June 6\u20138, 2004, Proceedings, Delgrande, J. P. and Schaub, T. , Eds. 1\u20139."},{"key":"S147106842300008X_ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2014.12.004"},{"key":"S147106842300008X_ref51","unstructured":"Riguzzi, F. 2015. The distribution semantics is well-defined for all normal programs. In Proceedings of the 2nd International Workshop on Probabilistic Logic Programming co-located with 31st International Conference on Logic Programming (ICLP 2015), Cork, Ireland, August 31st, 2015, F. Riguzzi and J. Vennekens, Eds. CEUR Workshop Proceedings, vol. 1413. CEUR-WS.org, 69\u201384."},{"key":"S147106842300008X_ref59","doi-asserted-by":"publisher","DOI":"10.1007\/s11225-009-9210-5"},{"key":"S147106842300008X_ref1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068420000253"},{"key":"S147106842300008X_ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2019.12.006"},{"key":"S147106842300008X_ref20","unstructured":"Darwiche, A. 2004. New advances in compiling CNF into decomposable negation normal form. In Proceedings of the 16th Eureopean Conference on Artificial Intelligence, ECAI\u20192004, including Prestigious Applicants of Intelligent Systems, PAIS 2004, Valencia, Spain, August 22-27, 2004, R. L. de M\u00e1ntaras and L. Saitta, Eds. IOS Press, 328\u2013332."},{"key":"S147106842300008X_ref52","doi-asserted-by":"publisher","DOI":"10.24963\/kr.2022\/31"},{"key":"S147106842300008X_ref31","doi-asserted-by":"crossref","unstructured":"Gutmann, B. , Thon, I. and De Raedt, L. 2011. Learning the parameters of probabilistic logic programs from interpretations. In Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2011, Athens, Greece, September 5-9, 2011. Proceedings, Part I, D. Gunopulos, T. Hofmann, D. Malerba and M. Vazirgiannis, Eds. Lecture Notes in Computer Science, vol. 6911. Springer, 581\u2013596.","DOI":"10.1007\/978-3-642-23780-5_47"},{"key":"S147106842300008X_ref16","unstructured":"Cozman, F. G. and Mau\u00e1, D. D. 2016. The structure and complexity of credal semantics. In Proceedings of the 3rd International Workshop on Probabilistic Logic Programming co-located with 26th International Conference on Inductive Logic Programming (ILP 2016), London, UK, September 3, 2016, A. Hommersom and S. A. Abdallah, Eds. CEUR Workshop Proceedings, vol. 1661. CEUR-WS.org, 3\u201314."},{"key":"S147106842300008X_ref8","doi-asserted-by":"publisher","DOI":"10.1038\/nrd1927"},{"key":"S147106842300008X_ref11","first-page":"137","article-title":"A survey on knowledge compilation","volume":"10","author":"Cadoli","year":"1997","journal-title":"AI Communications"},{"key":"S147106842300008X_ref40","doi-asserted-by":"crossref","unstructured":"Li, H. , Oren, N. and Norman, T. J. 2011. Probabilistic argumentation frameworks. In Theorie and Applications of Formal Argumentation - First International Workshop, TAFA 2011. Barcelona, Spain, July 16-17, 2011, Revised Selected Papers, S. Modgil, N. Oren and F. Toni, Eds. Lecture Notes in Computer Science, vol. 7132. Springer, 1\u201316.","DOI":"10.1007\/978-3-642-29184-5_1"},{"key":"S147106842300008X_ref2","doi-asserted-by":"crossref","unstructured":"Amgoud, L. , Ben-Naim, J. , Doder, D. and Vesic, S. 2017. Acceptability semantics for weighted argumentation frameworks. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017, C. Sierra, Ed. ijcai.org, 56\u201362.","DOI":"10.24963\/ijcai.2017\/9"},{"key":"S147106842300008X_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2018.11.019"},{"key":"S147106842300008X_ref17","doi-asserted-by":"publisher","DOI":"10.1613\/jair.5482"},{"volume-title":"Proceedings of the Tenth International Conference on Language Resources and Evaluation LREC 2016, Portoro\u017e, Slovenia","year":"2016","author":"Stede","key":"S147106842300008X_ref56"},{"key":"S147106842300008X_ref19","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010924021315"},{"key":"S147106842300008X_ref54","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, Tokyo, Japan, June 13-16, 1995, L. Sterling, Ed. MIT Press, 715\u2013729."},{"key":"S147106842300008X_ref34","first-page":"397","article-title":"Probabilistic argumentation: A survey","volume":"2","author":"Hunter","year":"2021","journal-title":"Handbook of Formal Argumentation"},{"key":"S147106842300008X_ref23","unstructured":"De Raedt, L. , Kimmig, A. and Toivonen, H. 2007. Problog: A probabilistic prolog and its application in link discovery. In IJCAI 2007, Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India, January 6-12, 2007, M. M. Veloso, Ed. 2462\u20132467."},{"key":"S147106842300008X_ref6","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068408003645"},{"key":"S147106842300008X_ref46","unstructured":"Nielsen, S. H. and Parsons, S. 2006. A generalization of dung\u2019s abstract framework for argumentation: Arguing with sets of attacking arguments. In Argumentation in Multi-Agent Systems, Third International Workshop, ArgMAS 2006, Hakodate, Japan, May 8, 2006, Revised Selected and Invited Papers, N. Maudet, S. Parsons and I. Rahwan, Eds. Lecture Notes in Computer Science, vol. 4766. Springer, 54\u201373."},{"key":"S147106842300008X_ref26","unstructured":"Fierens, D. , den Broeck, G. V. , Thon, I. , Gutmann, B. and De Raedt, L. 2011. Inference in probabilistic logic programs using weighted CNF\u2019s. In UAI 2011, Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, Barcelona, Spain, July 14-17, 2011, F. G. Cozman and A. Pfeffer, Eds. AUAI Press, 211\u2013220."},{"key":"S147106842300008X_ref49","doi-asserted-by":"crossref","unstructured":"Polberg, S. , Hunter, A. and Thimm, M. 2017. Belief in attacks in epistemic probabilistic argumentation. In Scalable Uncertainty Management - 11th International Conference, SUM 2017, Granada, Spain, October 4-6, 2017, Proceedings, S. Moral, O. Pivert, D. S\u00e1nchez and N. Mar\u00edn, Eds. Lecture Notes in Computer Science, vol. 10564. Springer, 223\u2013236.","DOI":"10.1007\/978-3-319-67582-4_16"},{"key":"S147106842300008X_ref53","doi-asserted-by":"crossref","unstructured":"Sacc\u00e0, D. and Zaniolo, C. 1990. Stable models and non-determinism in logic programs with negation. In Proceedings of the Ninth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, April 2\u20134, 1990, Nashville, Tennessee, USA, D. J. Rosenkrantz and Y. Sagiv, Eds. ACM Press, 205\u2013217.","DOI":"10.1145\/298514.298572"},{"key":"S147106842300008X_ref32","doi-asserted-by":"crossref","unstructured":"Hadjichristodoulou, S. and Warren, D. S. 2012. Probabilistic logic programming with well-founded negation. In 42nd IEEE International Symposium on Multiple-Valued Logic, ISMVL 2012, Victoria, BC, Canada, May 14-16, 2012, D. M. Miller and V. C. Gaudet, Eds. IEEE Computer Society, 232\u2013237.","DOI":"10.1109\/ISMVL.2012.26"},{"key":"S147106842300008X_ref29","unstructured":"Gelfond, M. and Lifschitz, V. 1988. The stable model semantics for logic programming. In Logic Programming, Proceedings of the Fifth International Conference and Symposium, Seattle, Washington, USA, August 15-19, 1988 (2 Volumes), R. A. Kowalski and K. A. Bowen, Eds. MIT Press, 1070\u20131080."},{"key":"S147106842300008X_ref58","first-page":"245","article-title":"CP-logic: A language of causal probabilistic events and its relation to logic programming","volume":"9","author":"Vennekens","year":"2009","journal-title":"TPLP"},{"key":"S147106842300008X_ref55","doi-asserted-by":"crossref","unstructured":"Sato, T. and Kameya, Y. 2008. New advances in logic-based probabilistic modeling by PRISM. See De Raedt et al. (2008), 118\u2013155.","DOI":"10.1007\/978-3-540-78652-8_5"},{"key":"S147106842300008X_ref4","unstructured":"Aziz, R. A. , Chu, G. , Muise, C. J. and Stuckey, P. J. 2015. Stable model counting and its application in probabilistic logic programming. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA, B. Bonet and S. Koenig, Eds. AAAI Press, 3468\u20133474."},{"key":"S147106842300008X_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2020.07.004"},{"key":"S147106842300008X_ref27","first-page":"620","article-title":"The well-founded semantics for general logic programs","volume":"38","author":"Gelder","year":"1991","journal-title":"J. ACM"},{"key":"S147106842300008X_ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-009-3049-0_2"},{"key":"S147106842300008X_ref9","doi-asserted-by":"publisher","DOI":"10.3233\/AAC-190476"},{"key":"S147106842300008X_ref45","doi-asserted-by":"crossref","unstructured":"Muise, C. J. , McIlraith, S. A. , Beck, J. C. and Hsu, E. I. 2012. Dsharp: Fast d-dnnf compilation with sharpsat. In Advances in Artificial Intelligence - 25th Canadian Conference on Artificial Intelligence, Canadian AI 2012, Toronto, ON, Canada, May 28-30, 2012. Proceedings, L. Kosseim and D. Inkpen, Eds. Lecture Notes in Computer Science, vol. 7310. Springer, 356\u2013361.","DOI":"10.1007\/978-3-642-30353-1_36"},{"key":"S147106842300008X_ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijar.2012.08.003"}],"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\/S147106842300008X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,24]],"date-time":"2024-01-24T12:06:44Z","timestamp":1706098004000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S147106842300008X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,25]]},"references-count":59,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2023,11]]}},"alternative-id":["S147106842300008X"],"URL":"https:\/\/doi.org\/10.1017\/s147106842300008x","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"type":"print","value":"1471-0684"},{"type":"electronic","value":"1475-3081"}],"subject":[],"published":{"date-parts":[[2023,5,25]]},"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"}]}}