{"type":"ScholarlyArticle","title":"Computational Properties of Resolution-based Grounded Semantics","authors":[{"name":"Pietro Baroni","slug":"pietro-baroni","given":"Pietro","family":"Baroni","affiliation":"Elettronica per l'Automazione University of Brescia Via Branze 38 25123 Brescia , Italy"},{"name":"Paul E. Dunne","slug":"paul-e-dunne","given":"Paul E.","family":"Dunne","affiliation":"Dept. of Computer Science University of Liverpool Ashton Building Liverpool L69 7ZF , United Kingdom"},{"name":"Massimiliano Giacomin","slug":"massimiliano-giacomin","given":"Massimiliano","family":"Giacomin","affiliation":"Elettronica per l'Automazione University of Brescia Via Branze 38 25123 Brescia , Italy"}],"abstract":"In the context of Dung's theory of abstract argumentation frameworks, the recently introduced resolution-based grounded semantics features the unique property of fully complying with a set of general requirements, only partially satisfied by previous literature proposals. This paper contributes to the investigation of resolution-based grounded semantics by analyzing its computational properties with reference to a standard set of decision problems for abstract argumentation semantics: (a) checking the property of being an extension for a set of arguments; (b) checking agreement with traditional grounded semantics; (c) checking the existence of a non-empty extension; (d) checking credulous acceptance of an argument; (e) checking skeptical acceptance of an argument. It is shown that problems (a)-(c) admit polynomial time decision processes, while (d) is NP-complete and (e) coNP-complete.Pietro Baroni, Paul E. Dunne, Massimiliano Giacomin","doi":null,"url":"https://ijcai.org/proceedings/2009/119","pdf":"https://ijcai.org/proceedings/2009/0119.pdf","markdown":"https://ijcai.org/proceedings/2009/119.md","bibtex":"https://ijcai.org/proceedings/2009/bibtex/119","volume":{"slug":"2009","title":"Proceedings of the Twenty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2009","url":"https://ijcai.org/proceedings/2009/","year":2009,"location":"Pasadena, California, USA","dates":"","editors":"Hiroaki Kitano","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":119,"pages":{"first":683,"last":688},"keywords":[],"videos":[],"references":[{"position":1,"raw":"[Baroni and Giacomin, 2007] P. Baroni and M. Gia- comin. On principle-based evaluation of extension- based argumentation semantics. Artificial Intelligence, 171(10/15):675-700, 2007.","title":"On principle-based evaluation of extensionbased argumentation semantics","authors":"P Baroni, M Giacomin","year":"2007","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baroni and Giacomin, 2008] P. Baroni and M. Giacomin. Resolution-based argumentation semantics. In P. Besnard, S. Doutre, and A. Hunter, editors, Proc. 2nd Int. Conf. on Computational Models of Argument (COMMA 2008), pages 25-36, Toulouse, F, 2008. IOS Press.","title":"Resolution-based argumentation semantics","authors":"P Baroni, M Giacomin","year":"2008","venue":"Proc. 2nd Int. Conf. on Computational Models of Argument (COMMA 2008)","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baroni et al., 2005] P. Baroni, M. Giacomin, and G. Guida. SCC-recursiveness: a general schema for argumenta- tion semantics. Artificial Intelligence, 168(1-2):165-210, 2005.","title":"SCC-recursiveness: a general schema for argumentation semantics","authors":"P Baroni, M Giacomin, G Guida","year":"2005","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Dimopoulos and Torres, 1996] Y. Dimopoulos and A. Tor- res. Graph theoretical structures in logic programs and default theories. Theoretical Computer Science, 170(1- 2):209-244, 1996.","title":"Graph theoretical structures in logic programs and default theories","authors":"Y Dimopoulos, A Torres","year":"1996","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Dung, 1995] P. M. Dung. On the acceptability of argu- ments and its fundamental role in nonmonotonic reason- ing, logic programming, and N -person games. Artificial Intelligence, 77(2):321-357, 1995.","title":"On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming, and N -person games","authors":"P M Dung","year":"1995","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Dunne and Bench-Capon, 2002] P. E. Dunne and T. J. M. Bench-Capon. Coherence in finite argument systems. Ar- tificial Intelligence, 141(1):187-203, 2002.","title":"Coherence in finite argument systems","authors":"P E Dunne, T J M Bench-Capon","year":"2002","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Dunne and Wooldridge, 2009] P. E. Dunne and M. Wooldridge. Complexity of abstract argumentation. In I. Rahwan and G. R. Simari, editors, Argumentation in Artificial Intelligence. Springer, Berlin, 2009.","title":"Complexity of abstract argumentation","authors":"P E Dunne, M Wooldridge","year":"2009","venue":"Argumentation in Artificial Intelligence","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}