{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,2]],"date-time":"2026-05-02T13:23:56Z","timestamp":1777728236780,"version":"3.51.4"},"reference-count":33,"publisher":"SAGE Publications","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IA"],"published-print":{"date-parts":[[2019,1,18]]},"DOI":"10.3233\/ia-180041","type":"journal-article","created":{"date-parts":[[2019,1,29]],"date-time":"2019-01-29T11:58:17Z","timestamp":1548763097000},"page":"181-191","source":"Crossref","is-referenced-by-count":0,"title":["Credulous and skeptical acceptability in probabilistic abstract argumentation: complexity results"],"prefix":"10.1177","volume":"12","author":[{"given":"Bettina","family":"Fazzinga","sequence":"first","affiliation":[{"name":"ICAR-CNR, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Flesca","sequence":"additional","affiliation":[{"name":"DIMES, University of Calabria, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Filippo","family":"Furfaro","sequence":"additional","affiliation":[{"name":"DIMES, University of Calabria, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","reference":[{"issue":"4","key":"10.3233\/IA-180041_ref1","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1017\/S0269888911000166","article-title":"An introduction to argumentation semantics","volume":"26","author":"Baroni","year":"2011","journal-title":"Knowledge Eng Review"},{"key":"10.3233\/IA-180041_ref2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/978-0-387-98197-0_2","article-title":"Semantics of abstract argument systems, In pp","author":"Baroni","year":"2009","journal-title":"Argumentation in Artificial Intelligence"},{"key":"10.3233\/IA-180041_ref3","unstructured":"Booth R. , Caminada M. , Dunne P.E. , Podlaszewski M. and Rahwan I. , Complexity properties of critical sets of arguments, In Proc of Computational Models of Argument (COMMA), 2014, pp. 173\u2013184."},{"key":"10.3233\/IA-180041_ref4","unstructured":"Caminada M. , Semi-stable semantics, In Proc Int Conf Computational Models of Argument (COMMA), 2006, pp. 121\u2013130."},{"key":"10.3233\/IA-180041_ref5","doi-asserted-by":"crossref","unstructured":"Cook S.A. , The complexity of theorem-proving procedures, In Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, Shaker Heights, Ohio, USA, 1971, pp. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"10.3233\/IA-180041_ref6","doi-asserted-by":"crossref","unstructured":"Coste-Marquis S. , Devred C. and Marquis P. , Symmetric argumentation frameworks, In Proc of Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU) (2005), 317\u2013328.","DOI":"10.1007\/11518655_28"},{"issue":"1-2","key":"10.3233\/IA-180041_ref7","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0304-3975(96)80707-9","article-title":"Graph theoretical structures in logic programs and default theories","volume":"170","author":"Dimopoulos","year":"1996","journal-title":"Theor Comput Sci"},{"key":"10.3233\/IA-180041_ref8","doi-asserted-by":"crossref","unstructured":"Doder D. and Woltran S. , Probabilistic argumentation frameworks - A logical approach, In Proc Int Conf on Scalable Uncertainty Management (SUM), 2014, pp. 134\u2013147.","DOI":"10.1007\/978-3-319-11508-5_12"},{"key":"10.3233\/IA-180041_ref9","doi-asserted-by":"crossref","unstructured":"Dondio P. , Computing the grounded semantics in all the subgraphs of an argumentation framework: An empirical evaluation, In Proc Int Workshop Computational Logic in Multi-Agent Systems (CLIMA), 2013, pp. 119\u2013137.","DOI":"10.1007\/978-3-642-40624-9_8"},{"issue":"3","key":"10.3233\/IA-180041_ref10","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1080\/01969722.2014.894854","article-title":"Toward a computational analysis of probabilistic argumentation frameworks","volume":"45","author":"Dondio","year":"2014","journal-title":"Cybernetics and Systems"},{"issue":"2","key":"10.3233\/IA-180041_ref11","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/0004-3702(94)00041-X","article-title":"On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games","volume":"77","author":"Minh","year":"1995","journal-title":"Artif Intell"},{"issue":"10-15","key":"10.3233\/IA-180041_ref12","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.artint.2007.05.003","article-title":"Computing ideal sceptical argumentation","volume":"171","author":"Dung","year":"2007","journal-title":"Artif Intell"},{"key":"10.3233\/IA-180041_ref13","unstructured":"Dung P.M. and Thang P.M. , Towards (probabilistic) argumentation for jury-based dispute resolution, In Proc Int Conf Computational Models of Argument (COMMA), 2010, pp. 171\u2013182."},{"key":"10.3233\/IA-180041_ref14","doi-asserted-by":"crossref","unstructured":"Dunne P.E. , The computational complexity of ideal semantics, Artif Intell 173(18) (2009).","DOI":"10.1016\/j.artint.2009.09.001"},{"issue":"1\/2","key":"10.3233\/IA-180041_ref15","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/S0004-3702(02)00261-8","article-title":"Coherence in finite argument systems","volume":"141","author":"Dunne","year":"2002","journal-title":"Artif Intell"},{"key":"10.3233\/IA-180041_ref16","doi-asserted-by":"crossref","unstructured":"Dunne P.E. and Caminada M. , Computational complexity of semi-stable semantics in abstract argumentation frameworks, In Proc European Conf on Logics in Artificial Intelligence (JELIA), 2008, pp. 153\u2013165.","DOI":"10.1007\/978-3-540-87803-2_14"},{"key":"10.3233\/IA-180041_ref17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-0-387-98197-0_5","article-title":"Complexity of abstract argumentation","author":"Dunne","year":"2009","journal-title":"Argumentation in Artificial Intelligence"},{"issue":"11","key":"10.3233\/IA-180041_ref18","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/j.ipl.2010.04.005","article-title":"Complexity of semistable and stage semantics in argumentation frameworks","volume":"110","author":"Dvor\u00e1k","year":"2010","journal-title":"Inf Process Lett"},{"issue":"3","key":"10.3233\/IA-180041_ref19","first-page":"22","article-title":"On the complexity of probabilistic abstract argumentation frameworks","volume":"16","author":"Fazzinga","year":"2015","journal-title":"ACM Trans Comput Log (TOCL)"},{"key":"10.3233\/IA-180041_ref20","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.ijar.2015.11.009","article-title":"On efficiently estimating the probability of extensions in abstract argumentation frameworks","volume":"69","author":"Fazzinga","year":"2016","journal-title":"Int J Approx Reasoning"},{"key":"10.3233\/IA-180041_ref21","doi-asserted-by":"crossref","unstructured":"Fazzinga B. , Flesca S. , Parisi F. and Pietramala A. , PARTY: A mobile system for efficiently assessing the probability of extensions in a debate, In Proc Int Conf on Database and Expert Systems Applications (DEXA), 2015, pp. 220\u2013235.","DOI":"10.1007\/978-3-319-22849-5_16"},{"issue":"2","key":"10.3233\/IA-180041_ref22","first-page":"177","article-title":"Computing or estimating extension\u2019s probabilities over structured probabilistic argumentation frameworks","volume":"3","author":"Fazzinga","year":"2016","journal-title":"Special Issue on Probabilistic and other Quantitative Approaches to Computational Argumentation of the IfCoLog Journal of Logics and their Applications"},{"issue":"5","key":"10.3233\/IA-180041_ref23","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1093\/logcom\/exs011","article-title":"The cf2 argumentation semantics revisited","volume":"23","author":"Gaggl","year":"2013","journal-title":"J Log Comput"},{"key":"10.3233\/IA-180041_ref24","unstructured":"Hunter A. , Some foundations for probabilistic abstract argumentation, In Proc Int Conf Computational Models of Argument (COMMA), 2012, pp. 117\u2013128."},{"issue":"1","key":"10.3233\/IA-180041_ref25","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/j.ijar.2012.08.003","article-title":"A probabilistic approach to modelling uncertain logical arguments","volume":"54","author":"Hunter","year":"2013","journal-title":"Int J Approx Reasoning"},{"issue":"2","key":"10.3233\/IA-180041_ref26","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1016\/j.ijar.2013.09.002","article-title":"Probabilistic qualification of attack in abstract argumentation","volume":"55","author":"Hunter","year":"2014","journal-title":"Int J Approx Reasoning"},{"key":"10.3233\/IA-180041_ref27","unstructured":"Hunter A. and Thimm M. , Probabilistic argumentation with epistemic extensions, In Proc Int Workshop on Defeasible and Ampliative Reasoning (DARe@ECAI), 2014."},{"key":"10.3233\/IA-180041_ref28","unstructured":"Hunter A. and Thimm M. , Probabilistic argumentation with incomplete information, In Proc European Conf. on Artificial Intelligence (ECAI), 2014, pp. 1033\u20131034."},{"key":"10.3233\/IA-180041_ref29","doi-asserted-by":"crossref","unstructured":"Li H. , Oren N. and Norman T.J. , Probabilistic argumentation frameworks, In Proc Int Workshop on Theorie and Applications of Formal Argumentation (TAFA), 2011.","DOI":"10.1007\/978-3-642-29184-5_1"},{"issue":"2","key":"10.3233\/IA-180041_ref30","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1080\/19462160903564592","article-title":"An abstract framework for argumentation with structured arguments","volume":"1","author":"Prakken","year":"2010","journal-title":"Argument & Computation"},{"key":"10.3233\/IA-180041_ref31","first-page":"138","article-title":"Towards a probabilistic dung-style argumentation system","author":"Rienstra","year":"2012","journal-title":"AT"},{"key":"10.3233\/IA-180041_ref32","unstructured":"Thimm M. , A probabilistic semantics for abstract argumentation, In Proc European Conf on Artificial Intelligence (ECAI), 2012, pp. 750\u2013755."},{"key":"10.3233\/IA-180041_ref33","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","article-title":"The complexity of computing the permanent","volume":"8","author":"Valiant","year":"1979","journal-title":"Theor Comput Sci (TCS)"}],"container-title":["Intelligenza Artificiale"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IA-180041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T10:51:34Z","timestamp":1777459894000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.medra.org\/servlet\/aliasResolver?alias=iospress&doi=10.3233\/IA-180041"}},"subtitle":[],"editor":[{"given":"Stefano","family":"Bistarelli","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Massimiliano","family":"Giacomin","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]},{"given":"Andrea","family":"Pazienza","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2019,1,18]]},"references-count":33,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.3233\/ia-180041","relation":{},"ISSN":["1724-8035","2211-0097"],"issn-type":[{"value":"1724-8035","type":"print"},{"value":"2211-0097","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,18]]}}}