{"type":"ScholarlyArticle","title":"On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks","authors":[{"name":"Markus Kröll","slug":"markus-kroll","given":"Markus","family":"Kröll","affiliation":"TU Wien , Austria"},{"name":"Reinhard Pichler","slug":"reinhard-pichler","given":"Reinhard","family":"Pichler","affiliation":"TU Wien , Austria"},{"name":"Stefan Woltran","slug":"stefan-woltran","given":"Stefan","family":"Woltran","affiliation":"TU Wien , Austria"}],"abstract":"Several computational problems of abstract argumentation frameworks (AFs) such as skeptical and credulous reasoning, existence of a non-empty extension, verification, etc. have been thoroughly analyzed for various semantics.  In contrast, the enumeration problem of AFs (i.e., the problem of computing all extensions according to some semantics) has been left unexplored so far.  The goal of this paper is to fill this gap.  We thus investigate the enumeration complexity of AFs for a large collection of semantics and, in addition, consider the most common structural restrictions on AFs.","doi":"10.24963/ijcai.2017/159","url":"https://ijcai.org/proceedings/2017/159","pdf":"https://ijcai.org/proceedings/2017/0159.pdf","markdown":"https://ijcai.org/proceedings/2017/159.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/159","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Knowledge Representation, Reasoning, and Logic","track":"Main track","number":159,"pages":{"first":1145,"last":1152},"keywords":["Knowledge Representation, Reasoning, and Logic: Computational Complexity of Reasoning","Knowledge Representation, Reasoning, and Logic: Computational models of Argument"],"videos":[],"references":[{"position":1,"raw":"[Bagan, 2006] Guillaume Bagan. MSO queries on tree de- composable structures are computable with linear delay. In Proc. CSL'06, volume 4207 of LNCS, pages 167-181. Springer, 2006.","title":"MSO queries on tree decomposable structures are computable with linear delay","authors":"Guillaume Bagan, Bagan","year":"2006","venue":"Proc. CSL'06","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Baroni et al., 2005] Pietro Baroni, Massimiliano Giacomin, and Giovanni Guida. SCC-recursiveness: a general schema for argumentation semantics. Artificial Intelli- gence, 168(1-2):162-210, 2005.","title":"SCC-recursiveness: a general schema for argumentation semantics","authors":"Pietro Baroni, Massimiliano Giacomin, Giovanni Guida","year":"2005","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Baroni et al., 2010] Pietro Baroni, Paul E. Dunne, and Mas- similiano Giacomin. On extension counting problems in argumentation frameworks. In Proc. COMMA 2010, vol- ume 216 of FAIA, pages 63-74. IOS Press, 2010.","title":"On extension counting problems in argumentation frameworks","authors":"Pietro Baroni, Paul E Dunne, Massimiliano Giacomin","year":"2010","venue":"Proc. COMMA 2010","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Baroni et al., 2011a] Pietro Baroni, Martin Caminada, and Massimiliano Giacomin. An introduction to argu- mentation semantics. Knowledge Engineering Review, 26(4):365-410, 2011.","title":"An introduction to argumentation semantics","authors":"Baroni","year":"2011","venue":"Knowledge Engineering Review","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Baroni et al., 2011b] Pietro Baroni, Paul E. Dunne, and Massimiliano Giacomin. On the resolution-based family of abstract argumentation semantics and its grounded in- stance. Artificial Intelligence, 175(3-4):791-813, 2011.","title":"On the resolution-based family of abstract argumentation semantics and its grounded instance","authors":"Baroni","year":"2011","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Bench-Capon and Dunne, 2007] Trevor J. M. Bench-Capon and Paul E. Dunne. Argumentation in artificial intelli- gence. Artificial Intelligence, 171(10-15):619-641, 2007.","title":"Argumentation in artificial intelligence","authors":"J M Trevor, Paul E Bench-Capon, Dunne","year":"2007","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Bulatov et al., 2012] Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, and Dániel Marx. Enumerating homomor- phisms. J. Comput. Syst. Sci., 78(2):638-650, 2012.","title":"Enumerating homomorphisms","authors":"Andrei A Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx","year":"2012","venue":"J. Comput. Syst. Sci","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Caminada and Amgoud, 2007] Martin Caminada and Leila Amgoud. On the evaluation of argumentation formalisms. Artificial Intelligence, 171(5-6):286-310, 2007.","title":"On the evaluation of argumentation formalisms","authors":"Amgoud Caminada, Martin Caminada, Leila Amgoud","year":"2007","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Caminada et al., 2012] Martin Caminada, Walter A. Carnielli, and Paul E. Dunne. Semi-stable semantics. J. Log. Comput., 22(5):1207-1254, 2012.","title":"Semi-stable semantics","authors":"Martin Caminada, Walter A Carnielli, Paul E Dunne","year":"2012","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Cerutti et al., 2014] Federico Cerutti, Massimiliano Gia- comin, Mauro Vallati, and Marina Zanella. An SCC re- cursive meta-algorithm for computing preferred labellings in abstract argumentation. In Proc. KR 2014, pages 42-51, 2014.","title":"An SCC recursive meta-algorithm for computing preferred labellings in abstract argumentation","authors":"Federico Cerutti, Massimiliano Giacomin, Mauro Vallati, Marina Zanella","year":"2014","venue":"Proc. KR 2014","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Coste-Marquis et al., 2005] Sylvie Coste-Marquis, Caro- line Devred, and Pierre Marquis. Symmetric argumenta- tion frameworks. In Proc. ECSQARU 2005, volume 3571 of LNCS, pages 317-328. Springer, 2005.","title":"Symmetric argumentation frameworks","authors":"Sylvie Coste-Marquis, Caroline Devred, Pierre Marquis","year":"2005","venue":"Proc. ECSQARU 2005","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Courcelle, 2009] Bruno Courcelle. Linear delay enumera- tion and monadic second-order logic. Discrete Applied Mathematics, 157(12):2675-2700, 2009.","title":"Linear delay enumeration and monadic second-order logic","authors":"Bruno Courcelle","year":"2009","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Creignou and Hébrard, 1997] Nadia Creignou and J-J Hébrard. On generating all solutions of generalized satis- fiability problems. Informatique théorique et applications, 31(6):499-511, 1997.","title":"On generating all solutions of generalized satisfiability problems","authors":"Nadia Creignou, J-J Hébrard","year":"1997","venue":"Informatique théorique et applications","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Creignou et al., 2013] Nadia Creignou, Arne Meier, Julian- Steffen Müller, Johannes Schmidt, and Heribert Vollmer. Paradigms for parameterized enumeration. In Proc. MFCS 2013, volume 8087 of LNCS, pages 290-301. Springer, 2013.","title":"Paradigms for parameterized enumeration","authors":"Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer","year":"2013","venue":"Proc. MFCS 2013","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Dimopoulos and Torres, 1996] Yannis Dimopoulos and Al- berto Torres. Graph theoretical structures in logic pro- grams and default theories. Theor. Comput. Sci., 170(1- 2):209-244, 1996.","title":"Graph theoretical structures in logic programs and default theories","authors":"Dimopoulos, Torres, Alberto Torres","year":"1996","venue":"Theor. Comput. Sci","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Dimopoulos et al., 1997] Yannis Dimopoulos, Vangelis Magirou, and Christos H Papadimitriou. On kernels, defaults and even graphs. Annals of Mathematics and Artificial Intelligence, 20(1-4):1-12, 1997.","title":"On kernels, defaults and even graphs","authors":"Yannis Dimopoulos, Vangelis Magirou, Christos H Papadimitriou","year":"1997","venue":"Annals of Mathematics and Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Dung, 1995] Phan Minh Dung. On the acceptability of ar- guments and its fundamental role in nonmonotonic rea- soning, 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":"Phan Minh, Dung","year":"1995","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Dunne and Bench-Capon, 2001] Paul E. Dunne and Trevor J. M. Bench-Capon. Complexity and combinatorial prop- erties of argument systems. Univ. Liverpool, Tech. report, 2001.","title":"Complexity and combinatorial properties of argument systems","authors":"Paul E Dunne, Trevor J M Bench-Capon","year":"2001","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Dunne and Bench-Capon, 2002] Paul E. Dunne and Trevor J. M. Bench-Capon. Coherence in finite argument systems. Artificial Intelligence, 141(1/2):187-203, 2002.","title":"Coherence in finite argument systems","authors":"Paul E Dunne, Trevor J M Bench-Capon","year":"2002","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Dunne et al., 2013] Paul E. Dunne, Wolfgang Dvořák, and Stefan Woltran. Parametric properties of ideal semantics. Artificial Intelligence, 202:1-28, 2013.","title":"Parametric properties of ideal semantics","authors":"Paul E Dunne, Wolfgang Dvořák, Stefan Woltran","year":"2013","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Dunne et al., 2015] Paul E. Dunne, Wolfgang Dvořák, Thomas Linsbichler, and Stefan Woltran. Characteristics of multiple viewpoints in abstract argumentation. Artificial Intelligence, 228:153-178, 2015.","title":"Characteristics of multiple viewpoints in abstract argumentation","authors":"Paul E Dunne, Wolfgang Dvořák, Thomas Linsbichler, Stefan Woltran","year":"2015","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Dunne, 2007] Paul E. Dunne. Computational properties of argument systems satisfying graph-theoretic constraints. Artificial Intelligence, 171(10-15):701-729, 2007.","title":"Computational properties of argument systems satisfying graph-theoretic constraints","authors":"Paul E Dunne","year":"2007","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Durand et al., 2014] Arnaud Durand, Nicole Schweikardt, and Luc Segoufin. Enumerating answers to first-order queries over databases of low degree. In Proc. PODS 2014, pages 121-131. ACM, 2014.","title":"Enumerating answers to first-order queries over databases of low degree","authors":"Arnaud Durand, Nicole Schweikardt, Luc Segoufin","year":"2014","venue":"Proc. PODS 2014","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Dvořák and Gaggl, 2016] Wolfgang Dvořák and Sarah Al- ice Gaggl. Stage semantics and the SCC-recursive schema for argumentation semantics. J. Log. Comput., 26(4):1149-1202, 2016.","title":"Wolfgang Dvořák and Sarah Alice Gaggl. Stage semantics and the SCC-recursive schema for argumentation semantics","authors":"Gaggl Dvořák","year":"2016","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Dvořák and Woltran, 2010] Wolfgang Dvořá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 Dvořák, Wolfgang Dvořák, Stefan Woltran","year":"2010","venue":"Inf. Process. Lett","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Dvořák et al., 2012] Wolfgang Dvořák, Stefan Szeider, and Stefan Woltran. Abstract argumentation via monadic sec- ond order logic. In Proc. SUM 2012, volume 7520 of LNCS, pages 85-98. Springer, 2012.","title":"Abstract argumentation via monadic second order logic","authors":"Dvořák","year":"2012","venue":"Proc. SUM 2012","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Dvořák et al., 2014] Wolfgang Dvořák, Matti Järvisalo, Jo- hannes P. Wallner, and Stefan Woltran. Complexity- sensitive decision procedures for abstract argumentation. Artificial Intelligence, 206:53-78, 2014.","title":"Complexitysensitive decision procedures for abstract argumentation","authors":"Dvořák","year":"2014","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Dvořák, 2012] Wolfgang Dvořák. Computational Aspects of Abstract Argumentation. PhD thesis, Technische Uni- versität Wien, 2012.","title":"Computational Aspects of Abstract Argumentation","authors":"Wolfgang Dvořák, Dvořák","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Flum et al., 2002] Jörg Flum, Markus Frick, and Martin Grohe. Query evaluation via tree-decompositions. J. ACM, 49(6):716-752, 2002.","title":"Query evaluation via tree-decompositions","authors":"Flum","year":"2002","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":30,"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":31,"raw":"[Goldberg, 1991] Leslie Ann Goldberg. Efficient algorithms for listing combinatorial structures. PhD thesis, Univer- sity of Edinburgh, UK, 1991.","title":"Efficient algorithms for listing combinatorial structures","authors":"Ann Leslie, Goldberg","year":"1991","venue":null,"doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Johnson et al., 1988] David S. Johnson, Christos H. Pa- padimitriou, and Mihalis Yannakakis. On generating all maximal independent sets. Inf. Process. Lett., 27(3):119- 123, 1988.","title":"On generating all maximal independent sets","authors":"David S Johnson, Christos H Papadimitriou, Mihalis Yannakakis","year":"1988","venue":"Inf. Process. Lett","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Kazana and Segoufin, 2013] Wojciech Kazana and Luc Segoufin. Enumeration of first-order queries on classes of structures with bounded expansion. In Proc. PODS 2013, pages 297-308. ACM, 2013.","title":"Enumeration of first-order queries on classes of structures with bounded expansion","authors":"Segoufin Kazana, Wojciech Kazana, Luc Segoufin","year":"2013","venue":"Proc. PODS 2013","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Kröll et al., 2016] Markus Kröll, Reinhard Pichler, and Se- bastian Skritek. On the complexity of enumerating the an- swers to well-designed pattern trees. In Proc. ICDT 2016, volume 48 of LIPIcs, pages 22:1-22:18, 2016.","title":"On the complexity of enumerating the answers to well-designed pattern trees","authors":"Markus Kröll, Reinhard Pichler, Sebastian Skritek","year":"2016","venue":"Proc. ICDT 2016","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Rahwan and Simari, 2009] Iyad Rahwan and Guillermo R. Simari, editors. Argumentation in Artificial Intelligence. Springer, 2009.","title":"Argumentation in Artificial Intelligence","authors":"Simari Rahwan","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Strozecki, 2010] Yann Strozecki. Enumeration complexity and matroid decomposition. PhD thesis, Université Paris Diderot -Paris 7, 2010.","title":"Enumeration complexity and matroid decomposition","authors":"Yann Strozecki","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Thimm et al., 2016] Matthias Thimm, Serena Villata, Fed- erico Cerutti, Nir Oren, Hannes Strass, and Mauro Val- lati. Summary report of the first international competition on computational models of argumentation. AI Magazine, 37(1):102-104, April 2016.","title":"Summary report of the first international competition on computational models of argumentation","authors":"Matthias Thimm, Serena Villata, Federico Cerutti, Nir Oren, Hannes Strass, Mauro Vallati","year":"2016","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Verheij, 1996] Bart Verheij. Two approaches to dialectical argumentation: admissible sets and argumentation stages. In Proc. NAIC, pages 357-368, 1996.","title":"Two approaches to dialectical argumentation: admissible sets and argumentation stages","authors":"Bart Verheij, Verheij","year":"1996","venue":"Proc. NAIC","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}