{"type":"ScholarlyArticle","title":"Abstract Argumentation Frameworks with Marginal Probabilities","authors":[{"name":"Bettina Fazzinga","slug":"bettina-fazzinga","given":"Bettina","family":"Fazzinga","affiliation":"DICES -University of Calabria , Italy; ICAR -CNR , Italy"},{"name":"Sergio Flesca","slug":"sergio-flesca","given":"Sergio","family":"Flesca","affiliation":"DIMES -University of Calabria , Italy"},{"name":"Filippo Furfaro","slug":"filippo-furfaro","given":"Filippo","family":"Furfaro","affiliation":"DIMES -University of Calabria , Italy"}],"abstract":"In the context of probabilistic AAFs, we intro-\r\nduce AAFs with marginal probabilities (mAAFs)\r\nrequiring only marginal probabilities of argu-\r\nments/attacks to be specified and not relying on the\r\nindependence assumption. Reasoning over mAAFs\r\nrequires taking into account multiple probability\r\ndistributions over the possible worlds, so that the\r\nprobability of extensions is not determined by a\r\nunique value, but by an interval. We focus on the\r\nproblems of computing the max and min probabil-\r\nities of extensions over mAAFs under Dung’s se-\r\nmantics, characterize their complexity, and provide\r\nclosed formulas for polynomial cases.","doi":"10.24963/ijcai.2022/362","url":"https://ijcai.org/proceedings/2022/362","pdf":"https://ijcai.org/proceedings/2022/0362.pdf","markdown":"https://ijcai.org/proceedings/2022/362.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/362","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Knowledge Representation and Reasoning","track":"Main Track","number":362,"pages":{"first":2613,"last":2619},"keywords":["Knowledge Representation and Reasoning: Argumentation","Knowledge Representation and Reasoning: Computational Complexity of Reasoning","Agent-based and Multi-agent Systems: Agreement Technologies: Argumentation"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38987102","length_sec":92,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38985245","length_sec":704,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Alfano et al., 2022] Gianvincenzo Alfano, Sergio Greco, Francesco Parisi, and Irina Trubitsyna. Incomplete ar- gumentation frameworks: Properties and complexity. In Proc. of AAAI, 2022.","title":"Incomplete argumentation frameworks: Properties and complexity","authors":"Alfano","year":"2022","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Amgoud and Vesic, 2011] Leila Amgoud and Srdjan Vesic. A new approach for preference-based argumentation frameworks. Ann. Math. Artif. Intell., 63(2), 2011.","title":"Leila Amgoud and Srdjan Vesic. A new approach for preference-based argumentation frameworks","authors":"Vesic Amgoud","year":"2011","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Atkinson and Bench-Capon, 2016] Katie Atkinson and Trevor Bench-Capon. Value based reasoning and the actions of others. In Proc. European Conf. on Artificial Intelligence (ECAI), pages 680-688, 2016.","title":"Value based reasoning and the actions of others","authors":"Katie Atkinson, Trevor Bench-Capon","year":"2016","venue":"Proc. European Conf. on Artificial Intelligence (ECAI)","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Baier et al., 2021] Christel Baier, Martin Diller, Clemens Dubslaff, Sarah Alice Gaggl, Holger Hermanns, and Niko- lai Käfer. Admissibility in probabilistic argumentation. In Proc, Conf. on Principles of Knowledge Representation and Reasoning, KR, pages 87-98, 2021.","title":"Admissibility in probabilistic argumentation","authors":"Christel Baier, Martin Diller, Clemens Dubslaff, Sarah Alice Gaggl, Holger Hermanns, Nikolai Käfer","year":"2021","venue":"Proc, Conf. on Principles of Knowledge Representation and Reasoning, KR","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Baumeister et al., 2018] Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe, and Hilmar Schadrack. Verifi- cation in incomplete argumentation frameworks. Artif. Intell., 264:1-26, 2018.","title":"Verification in incomplete argumentation frameworks","authors":"Dorothea Baumeister, Daniel Neugebauer, Jörg Rothe, Hilmar Schadrack","year":"2018","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bench-Capon, 2003] Trevor J. M. Bench-Capon. Persua- sion in practical argument using value-based argumenta- tion frameworks. J. Log. Comput., 13(3):429-448, 2003.","title":"Persuasion in practical argument using value-based argumentation frameworks","authors":"J M Trevor, Bench-Capon","year":"2003","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Doder and Woltran, 2014] Dragan Doder and Stefan Woltran. Probabilistic argumentation frameworks -A logical approach. In Proc. Conf. Scalable Uncertainty Management (SUM), pages 134-147, 2014.","title":"Probabilistic argumentation frameworks -A logical approach","authors":"Dragan Doder, Stefan Woltran","year":"2014","venue":"Proc. Conf. Scalable Uncertainty Management (SUM)","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Dondio, 2014] Pierpaolo Dondio. Toward a computational analysis of probabilistic argumentation frameworks. Cy- bernetics and Systems, 45(3):254-278, 2014.","title":"Toward a computational analysis of probabilistic argumentation frameworks","authors":"Pierpaolo Dondio","year":"2014","venue":"Cybernetics and Systems","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Dung and Thang, 2010] Phan Minh Dung and Phan Minh Thang. Towards (probabilistic) argumentation for jury- based dispute resolution. In Proc. Computational Models of Argument (COMMA), pages 171-182, 2010.","title":"Towards (probabilistic) argumentation for jurybased dispute resolution","authors":"Minh Phan, Dung, Phan Minh, Thang","year":"2010","venue":"Proc. Computational Models of Argument (COMMA)","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Dung, 1995] Phan Minh Dung. On the acceptability of ar- guments and its fundamental role in nonmonotonic reason- ing, logic programming and n-person games. Artif. Intell., 77(2):321-358, 1995.","title":"On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games","authors":"Phan Minh, Dung","year":"1995","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Fazzinga et al., 2015] Bettina Fazzinga, Sergio Flesca, and Francesco Parisi. On the complexity of probabilistic ab- stract argumentation frameworks. ACM Trans. Comput. Log., 16(3):22:1-22:39, 2015.","title":"On the complexity of probabilistic abstract argumentation frameworks","authors":"Bettina Fazzinga, Sergio Flesca, Francesco Parisi","year":"2015","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Fazzinga et al., 2018] Bettina Fazzinga, Sergio Flesca, and Filippo Furfaro. Probabilistic bipolar abstract argumenta- tion frameworks: complexity results. In Proc. Joint Conf. on Artificial Intelligence (IJCAI), 2018.","title":"Probabilistic bipolar abstract argumentation frameworks: complexity results","authors":"Bettina Fazzinga, Sergio Flesca, Filippo Furfaro","year":"2018","venue":"Proc. Joint Conf. on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2018/249"},{"position":13,"raw":"[Fazzinga et al., 2019] Bettina Fazzinga, Sergio Flesca, and Filippo Furfaro. Complexity of fundamental problems in probabilistic abstract argumentation: Beyond indepen- dence. Artif. Intell., 268:1-29, 2019.","title":"Complexity of fundamental problems in probabilistic abstract argumentation: Beyond independence","authors":"Bettina Fazzinga, Sergio Flesca, Filippo Furfaro","year":"2019","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Fazzinga et al., 2020] Bettina Fazzinga, Sergio Flesca, and Filippo Furfaro. Revisiting the notion of extension over incomplete abstract argumentation frameworks. In Proc. Joint Conf. on Artificial Intelligence (IJCAI), 2020.","title":"Revisiting the notion of extension over incomplete abstract argumentation frameworks","authors":"Bettina Fazzinga, Sergio Flesca, Filippo Furfaro","year":"2020","venue":"Proc. Joint Conf. on Artificial Intelligence (IJCAI)","doi":null,"url":null,"internal_url":"/proceedings/2020/237"},{"position":15,"raw":"[Fazzinga et al., 2021a] Bettina Fazzinga, Sergio Flesca, and Filippo Furfaro. Reasoning over argument-incomplete aafs in the presence of correlations. In Proc. Joint Conf. on Artificial Intelligence (IJCAI). ijcai.org, 2021.","title":"Reasoning over argument-incomplete aafs in the presence of correlations","authors":"Fazzinga","year":"2021","venue":"Proc. Joint Conf. on Artificial Intelligence (IJCAI). ijcai.org","doi":null,"url":null,"internal_url":"/proceedings/2021/27"},{"position":16,"raw":"[Fazzinga et al., 2021b] Bettina Fazzinga, Sergio Flesca, and Filippo Furfaro. Reasoning over attack-incomplete aafs in the presence of correlations. In Proc. Principles of Knowl- edge Representation and Reasoning (KR), 2021.","title":"Reasoning over attack-incomplete aafs in the presence of correlations","authors":"Fazzinga","year":"2021","venue":"Proc. Principles of Knowledge Representation and Reasoning (KR)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Gaignier et al., 2021] Fabrice Gaignier, Yannis Dimopou- los, Jean-Guy Mailly, and Pavlos Moraitis. Probabilis- tic control argumentation frameworks. In Proc. of Conf. on Autonomous Agents and Multiagent Systems AAMAS, pages 519-527, 2021.","title":"Probabilistic control argumentation frameworks","authors":"Fabrice Gaignier, Yannis Dimopoulos, Jean-Guy Mailly, Pavlos Moraitis","year":"2021","venue":"Proc. of Conf. on Autonomous Agents and Multiagent Systems AAMAS","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Georgakopoulos et al., 1988] George F. Georgakopoulos, Dimitris J. Kavvadias, and Christos H. Papadimitriou. Probabilistic satisfiability. J. Complex., 4(1):1-11, 1988.","title":"Probabilistic satisfiability","authors":"George F Georgakopoulos, Dimitris J Kavvadias, Christos H Papadimitriou","year":"1988","venue":"J. Complex","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Hunter and Thimm, 2014] Anthony Hunter and Matthias Thimm. Probabilistic argumentation with epistemic ex- tensions. In Proc. of the International Workshop on De- feasible and Ampliative Reasoning, DARe@ECAI, 2014.","title":"Probabilistic argumentation with epistemic extensions","authors":"Anthony Hunter, Matthias Thimm","year":"2014","venue":"Proc. of the International Workshop on Defeasible and Ampliative Reasoning, DARe@ECAI","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Hunter et al., 2020] Anthony Hunter, Sylwia Polberg, and Matthias Thimm. Epistemic graphs for representing and reasoning with positive and negative influences of argu- ments. Artif. Intell., 281:103236, 2020.","title":"Epistemic graphs for representing and reasoning with positive and negative influences of arguments","authors":"Anthony Hunter, Sylwia Polberg, Matthias Thimm","year":"2020","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Hunter, 2012] Anthony Hunter. Some foundations for prob- abilistic abstract argumentation. In Proc. Computational Models of Argument (COMMA), pages 117-128, 2012.","title":"Some foundations for probabilistic abstract argumentation","authors":"Anthony Hunter","year":"2012","venue":"Proc. Computational Models of Argument (COMMA)","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Hunter, 2014] Anthony Hunter. Probabilistic qualification of attack in abstract argumentation. Int. J. Approx. Rea- soning, 55(2):607-638, 2014.","title":"Probabilistic qualification of attack in abstract argumentation","authors":"Anthony Hunter","year":"2014","venue":"Int. J. Approx. Reasoning","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Li et al., 2011] Hengfei Li, Nir Oren, and Timothy J. Nor- man. Probabilistic argumentation frameworks. In Proc. Int. Workshop on Theory and Applications of Formal Ar- gumentation (TAFA), pages 1-16, 2011.","title":"Probabilistic argumentation frameworks","authors":"Hengfei Li, Nir Oren, Timothy J","year":"2011","venue":"Proc. Int. Workshop on Theory and Applications of Formal Argumentation (TAFA)","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Mailly, 2021] Jean-Guy Mailly. Constrained incomplete ar- gumentation frameworks. In Proc. of European Conf. on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, ECSQARU, pages 103-116, 2021.","title":"Constrained incomplete argumentation frameworks","authors":"Jean-Guy Mailly","year":"2021","venue":"Proc. of European Conf. on Symbolic and Quantitative Approaches to Reasoning with Uncertainty","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Nilsson, 1986] Nils J. Nilsson. Probabilistic logic. Artif. Intell., 28(1):71-87, 1986.","title":"Probabilistic logic","authors":"Nils J Nilsson","year":"1986","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Polberg and Doder, 2014] Sylwia Polberg and Dragan Do- der. Probabilistic abstract dialectical frameworks. In Proc. European Conf. on Logics in Artificial Intelligence, JELIA, pages 591-599, 2014.","title":"Probabilistic abstract dialectical frameworks","authors":"Sylwia Polberg, Dragan Doder","year":"2014","venue":"Proc. European Conf. on Logics in Artificial Intelligence, JELIA","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Potyka, 2021] Nico Potyka. From probabilistic program- ming to probabilistic argumentation. In Proc. of the Inter- national Conference on Logic Programming (ICLP), 2021.","title":"From probabilistic programming to probabilistic argumentation","authors":"Nico Potyka","year":"2021","venue":"Proc. of the International Conference on Logic Programming (ICLP)","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Rienstra, 2012] Tjitze Rienstra. Towards a probabilistic dung-style argumentation system. In Proc. Int. Conf. on Agreement Technologies (AT), pages 138-152, 2012.","title":"Towards a probabilistic dung-style argumentation system","authors":"Tjitze Rienstra, Rienstra","year":"2012","venue":"Proc. Int. Conf. on Agreement Technologies (AT)","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Santini et al., 2018] Francesco Santini, Audun Jøsang, and Maria Silvia Pini. Are my arguments trustworthy? abstract argumentation with subjective logic. In Proc. Int. Conf. on Information Fusion (FUSION), pages 1982-1989, 2018.","title":"Are my arguments trustworthy? abstract argumentation with subjective logic","authors":"Francesco Santini, Audun Jøsang, Maria Silvia Pini","year":"2018","venue":"Proc. Int. Conf. on Information Fusion (FUSION)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}