{"type":"ScholarlyArticle","title":"Complexity of Fundamental Problems in Probabilistic Abstract Argumentation: Beyond Independence (Extended Abstract)","authors":[{"name":"Bettina Fazzinga","slug":"bettina-fazzinga","given":"Bettina","family":"Fazzinga","affiliation":"ICAR-CNR , Via P. Bucci , 87036 Rende (CS) , ITALY"},{"name":"Sergio Flesca","slug":"sergio-flesca","given":"Sergio","family":"Flesca","affiliation":"DIMES -Università della Calabria , Via P. Bucci , 87036 Rende (CS) , ITALY"},{"name":"Filippo Furfaro","slug":"filippo-furfaro","given":"Filippo","family":"Furfaro","affiliation":"DIMES -Università della Calabria , Via P. Bucci , 87036 Rende (CS) , ITALY"}],"abstract":"The complexity of the probabilistic counterparts of the verification and acceptance problems is investigated over probabilistic Abstract Argumentation Frameworks (prAAFs), in a setting more general\r\nthan the literature, where the complexity has been characterized only under independence between arguments/defeats.\r\nThe complexity of these problems is shown to depend on the semantics of the extensions, the way of encoding the prAAF, and the correlations between arguments/defeats.\r\nIn this regard, in order to study the impact of different  correlations between arguments/defeats on the complexity, a new form of prAAF is introduced, called gen.\r\nIt is based on the well-known paradigm of world-set sets, and it allows the correlations to be easily distinguishable.","doi":"10.24963/ijcai.2019/888","url":"https://ijcai.org/proceedings/2019/888","pdf":"https://ijcai.org/proceedings/2019/0888.pdf","markdown":"https://ijcai.org/proceedings/2019/888.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/888","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Journal track","track":"Journal track","number":888,"pages":{"first":6362,"last":6366},"keywords":["Knowledge Representation and Reasoning: Computational Complexity of Reasoning","Agent-based and Multi-agent Systems: Agreement Technologies: Argumentation","Uncertainty in AI: Uncertainty in AI","Knowledge Representation and Reasoning: Computational Models of Argument"],"videos":[],"references":[{"position":1,"raw":"[Amgoud and Vesic, 2011] Leila Amgoud and Srdjan Vesic. A new approach for preference-based argumentation frameworks. Ann. Math. Artif. Intell., 63(2):149-183, 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":2,"raw":"[Antova et al., 2008] Lyublena Antova, Thomas Jansen, Christoph Koch, and Dan Olteanu. Fast and simple re- lational processing of uncertain data. In Proc. 24th Int. Conf. on Data Engineering: ICDE, April 7-12, Cancún, Mexico, pages 983-992, 2008.","title":"Fast and simple relational processing of uncertain data","authors":"Antova","year":"2008","venue":"Proc. 24th Int. Conf. on Data Engineering: ICDE","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baroni and Giacomin, 2009] Pietro Baroni and Massimil- iano Giacomin. Semantics of abstract argument systems. In Argumentation in AI, pages 25-44. 2009.","title":"Pietro Baroni and Massimiliano Giacomin","authors":"Giacomin Baroni","year":"2009","venue":"Argumentation in AI","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Baroni et al., 2011] Pietro Baroni, Martin Caminada, and Massimiliano Giacomin. An introduction to argumenta- tion semantics. Knowledge Eng. Review, 26(4):365-410, 2011.","title":"An introduction to argumentation semantics","authors":"Pietro Baroni, Martin Caminada, Massimiliano Giacomin","year":"2011","venue":"Knowledge Eng. Review","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Booth et al., 2014] Richard Booth, Martin Caminada, Paul E. Dunne, Mikolaj Podlaszewski, and Iyad Rahwan. Complexity properties of critical sets of arguments. In Proc. Computational Models of Argument: COMMA, Scottish Highlands, UK, Sept. 9-12, pages 173-184, 2014.","title":"Complexity properties of critical sets of arguments","authors":"Richard Booth, Martin Caminada, Paul E Dunne, Mikolaj Podlaszewski, Iyad Rahwan","year":"2014","venue":"Proc. Computational Models of Argument: COMMA","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Coste-Marquis et al., 2012] Sylvie Coste-Marquis, Sébastien Konieczny, Pierre Marquis, and Mohand Akli Ouali. Weighted attacks in argumentation frameworks. In Proc. Principles of Knowledge Representation and Reasoning: KR, Rome, Italy, June 10-14, 2012.","title":"Weighted attacks in argumentation frameworks","authors":"Sylvie Coste-Marquis, Sébastien Konieczny, Pierre Marquis, Mohand Akli, Ouali","year":"2012","venue":"Proc. Principles of Knowledge Representation and Reasoning: KR","doi":null,"url":null,"internal_url":null},{"position":7,"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":8,"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, Sept. 8-10, 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":9,"raw":"[Dung et al., 2007] Phan Minh Dung, Paolo Mancarella, and Francesca Toni. Computing ideal sceptical argumentation. Artif. Intell., 171(10-15):642-674, 2007.","title":"Computing ideal sceptical argumentation","authors":"Minh Phan, Paolo Dung, Francesca Mancarella, Toni","year":"2007","venue":"Artif. Intell","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":"[Dunne and Caminada, 2008] Paul E. Dunne and Martin Caminada. Computational complexity of semi-stable se- mantics in abstract argumentation frameworks. In Proc. European Conf. on Logics in AI: JELIA, Dresden, Ger- many, Sept. 28 -Oct. 1, pages 153-165, 2008.","title":"Computational complexity of semi-stable semantics in abstract argumentation frameworks","authors":"Paul E Dunne, Martin Caminada","year":"2008","venue":"Proc. European Conf. on Logics in AI: JELIA","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Dunne and Wooldridge, 2009] Paul E. Dunne and Michael Wooldridge. Complexity of abstract argumentation. In Ar- gumentation in Artificial Intelligence, pages 85-104. 2009.","title":"Complexity of abstract argumentation","authors":"Paul E Dunne, Michael Wooldridge","year":"2009","venue":"Argumentation in Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Dunne et al., 2011] Paul E. Dunne, Anthony Hunter, Pe- ter McBurney, Simon Parsons, and Michael Wooldridge. Weighted argument systems: Basic definitions, algo- rithms, and complexity results. Artif. Intell., 175(2):457- 486, 2011.","title":"Weighted argument systems: Basic definitions, algorithms, and complexity results","authors":"Paul E Dunne, Anthony Hunter, Peter Mcburney, Simon Parsons, Michael Wooldridge","year":"2011","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Dunne, 2009] Paul E. Dunne. The computational complex- ity of ideal semantics. Artif. Intell., 173(18):1559-1591, 2009.","title":"The computational complexity of ideal semantics","authors":"Paul E Dunne","year":"2009","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Dvorák and Woltran, 2010] Wolfgang Dvorák and Stefan Woltran. Complexity of semi-stable and stage seman- tics in argumentation frameworks. Inf. Process. Lett., 110(11):425-430, 2010.","title":"Complexity of semi-stable and stage semantics in argumentation frameworks","authors":"Woltran Dvorák, Wolfgang Dvorák, Stefan Woltran","year":"2010","venue":"Inf. Process. Lett","doi":null,"url":null,"internal_url":null},{"position":16,"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":17,"raw":"[Fazzinga et al., 2016] Bettina Fazzinga, Sergio Flesca, and Francesco Parisi. On efficiently estimating the probability of extensions in abstract argumentation frameworks. Int. J. Approx. Reasoning, 69:106-132, 2016.","title":"On efficiently estimating the probability of extensions in abstract argumentation frameworks","authors":"Bettina Fazzinga, Sergio Flesca, Francesco Parisi","year":"2016","venue":"Int. J. Approx. Reasoning","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Fazzinga et al., 2017] Bettina Fazzinga, Sergio Flesca, and Filippo Furfaro. Credulous acceptability in probabilis- tic abstract argumentation: Complexity results. In Proc. Workshop on Advances In Argumentation In Artificial In- telligence, Bari, Italy, Nov. 16-17, pages 43-57, 2017.","title":"Credulous acceptability in probabilistic abstract argumentation: Complexity results","authors":"Bettina Fazzinga, Sergio Flesca, Filippo Furfaro","year":"2017","venue":"Proc. Workshop on Advances In Argumentation In Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Fazzinga et al., 2018a] Bettina Fazzinga, Sergio Flesca, and Filippo Furfaro. Credulous and skeptical acceptability in probabilistic abstract argumentation: complexity results. Intelligenza Artificiale, 12(2):181-191, 2018.","title":"Credulous and skeptical acceptability in probabilistic abstract argumentation: complexity results","authors":"Fazzinga","year":"2018","venue":"Intelligenza Artificiale","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Fazzinga et al., 2018b] Bettina Fazzinga, Sergio Flesca, and Filippo Furfaro. Probabilistic bipolar abstract argumenta- tion frameworks: complexity results. In Proc. Int. Conf. on Artificial Intelligence: IJCAI, July 13-19, Stockholm, Sweden., pages 1803-1809, 2018.","title":"Probabilistic bipolar abstract argumentation frameworks: complexity results","authors":"Fazzinga","year":"2018","venue":"Proc. Int. Conf. on Artificial Intelligence: IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/249"},{"position":21,"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":22,"raw":"[Gaggl and Woltran, 2013] Sarah Alice Gaggl and Stefan Woltran. The cf2 argumentation semantics revisited. J. Log. Comput., 23(5):925-949, 2013.","title":"The cf2 argumentation semantics revisited","authors":"Alice Sarah, Stefan Gaggl, Woltran","year":"2013","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Kim et al., 2011] Eun Jung Kim, Sebastian Ordyniak, and Stefan Szeider. Algorithms and complexity results for persuasive argumentation. Artif. Intell., 175(9-10):1722- 1736, 2011.","title":"Algorithms and complexity results for persuasive argumentation","authors":"Eun Jung, Kim, Sebastian Ordyniak, Stefan Szeider","year":"2011","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Koch and Olteanu, 2008] Christoph Koch and Dan Olteanu. Conditioning probabilistic databases. PVLDB, 1(1):313- 325, 2008.","title":"Conditioning probabilistic databases","authors":"Olteanu Koch, Christoph Koch, Dan Olteanu","year":"2008","venue":"PVLDB","doi":null,"url":null,"internal_url":null},{"position":25,"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, July 16-17, 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":26,"raw":"[Rienstra, 2012] Tjitze Rienstra. Towards a probabilistic dung-style argumentation system. In Proc. Int. Conf. on Agreement Technologies, AT, Dubrovnik, Croatia, Octo- ber 15-16, 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","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Thimm, 2012] Matthias Thimm. A probabilistic semantics for abstract argumentation. In Proc. European Conf. on Ar- tificial Intelligence: ECAI, System Demonstrations Track, Montpellier, France, August 27-31, pages 750-755, 2012.","title":"A probabilistic semantics for abstract argumentation","authors":"Matthias Thimm","year":"2012","venue":"Proc. European Conf. on Artificial Intelligence: ECAI, System Demonstrations Track","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}