{"type":"ScholarlyArticle","title":"A General Notion of Equivalence for Abstract Argumentation","authors":[{"name":"Ringo Baumann","slug":"ringo-baumann","given":"Ringo","family":"Baumann","affiliation":"University of Leipzig , Germany"},{"name":"Wolfgang Dvořák","slug":"wolfgang-dvorak","given":"Wolfgang","family":"Dvořák","affiliation":"TU Wien , Austria"},{"name":"Thomas Linsbichler","slug":"thomas-linsbichler","given":"Thomas","family":"Linsbichler","affiliation":"TU Wien , Austria"},{"name":"Stefan Woltran","slug":"stefan-woltran","given":"Stefan","family":"Woltran","affiliation":"TU Wien , Austria"}],"abstract":"We introduce a parametrized equivalence notion for abstract argumentation that subsumes standard and strong equivalence as corner cases. Under this notion, two argumentation frameworks are equivalent if they deliver the same extensions under any addition of arguments and attacks that do not affect a given set of core arguments. As we will see, this notion of equivalence nicely captures the concept of local simplifications.  We provide exact characterizations and complexity results for deciding our new notion of equivalence.","doi":"10.24963/ijcai.2017/111","url":"https://ijcai.org/proceedings/2017/111","pdf":"https://ijcai.org/proceedings/2017/0111.pdf","markdown":"https://ijcai.org/proceedings/2017/111.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/111","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, IIIA-CSIC","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":111,"pages":{"first":800,"last":806},"keywords":["Knowledge Representation, Reasoning, and Logic: Computational models of Argument","Knowledge Representation, Reasoning, and Logic: Computational Complexity of Reasoning"],"videos":[],"references":[{"position":1,"raw":"[Baroni et al., 2005] Pietro Baroni, Massimiliano Giacomin, and Giovanni Guida. SCC-recursiveness: A general schema for argumentation semantics. Artif. Intell., 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":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":2,"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":3,"raw":"[Baroni et al., 2014a] Pietro Baroni, Guido Boella, Federico Cerutti, Massimiliano Giacomin, Leendert W. N. van der Torre, and Serena Villata. On the input/output behavior of argumentation frameworks. Artif. Intell., 217:144-197, 2014.","title":"On the input/output behavior of argumentation frameworks","authors":"Baroni","year":"2014","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Baroni et al., 2014b] Pietro Baroni, Massimiliano Gia- comin, and Beishui Liao. On topology-related properties of abstract argumentation semantics. A correction and ex- tension to dynamics of argumentation systems: A division- based method. Artif. Intell., 212:104-115, 2014.","title":"On topology-related properties of abstract argumentation semantics. A correction and extension to dynamics of argumentation systems: A divisionbased method","authors":"Baroni","year":"2014","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Baumann and Brewka, 2010] Ringo Baumann and Gerhard Brewka. Expanding argumentation frameworks: Enforc- ing and monotonicity results. In Pietro Baroni, Federico Cerutti, Massimiliano Giacomin, and Guillermo R. Simari, editors, Proc. COMMA, volume 216 of Frontiers in Ar- tificial Intelligence and Applications, pages 75-86. IOS Press, 2010.","title":"Expanding argumentation frameworks: Enforcing and monotonicity results","authors":"Brewka Baumann, Ringo Baumann, Gerhard Brewka","year":"2010","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Baumann and Brewka, 2015] Ringo Baumann and Gerhard Brewka. The equivalence zoo for Dung-style semantics. J. Log. Comput., 2015. doi.org/10.1093/logcom/exv001.","title":"The equivalence zoo for Dung-style semantics","authors":"Brewka Baumann, Ringo Baumann, Gerhard Brewka","year":"2015","venue":"J. Log. Comput","doi":".org/10.1093/logcom/exv001","url":null,"internal_url":null},{"position":7,"raw":"[Baumann and Woltran, 2016] Ringo Baumann and Stefan Woltran. The role of self-attacking arguments in char- acterizations of equivalence notions. J. Log. Comput., 26(4):1293-1313, 2016.","title":"The role of self-attacking arguments in characterizations of equivalence notions","authors":"Woltran Baumann, Ringo Baumann, Stefan Woltran","year":"2016","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Baumann et al., 2012] Ringo Baumann, Gerhard Brewka, Wolfgang Dvořák, and Stefan Woltran. Parameterized splitting: A simple modification-based approach. In Esra Erdem, Joohyung Lee, Yuliya Lierler, and David Pearce, editors, Correct Reasoning -Essays on Logic-Based AI in Honour of Vladimir Lifschitz, volume 7265 of Lecture Notes in Computer Science, pages 57-71. Springer, 2012.","title":"Parameterized splitting: A simple modification-based approach","authors":"Baumann","year":"2012","venue":"Correct Reasoning -Essays on Logic-Based AI in Honour of Vladimir Lifschitz","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Baumann et al., 2016] Ringo Baumann, Thomas Linsbich- ler, and Stefan Woltran. Verifiability of argumentation semantics. In Pietro Baroni, Thomas F. Gordon, Tatjana Scheffler, and Manfred Stede, editors, Proc. COMMA, vol- ume 287 of Frontiers in Artificial Intelligence and Appli- cations, pages 83-94. IOS Press, 2016.","title":"Verifiability of argumentation semantics","authors":"Baumann","year":"2016","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Baumann et al., 2017] Ringo Baumann, Wolfgang Dvořák, Thomas Linsbichler, and Stefan Woltran. A general no- tion of equivalence for abstract argumentation. Technical Report DBAI-TR-2017-105, TU Wien, 2017.","title":"A general notion of equivalence for abstract argumentation","authors":"Baumann","year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Baumann, 2011] Ringo Baumann. Splitting an argumen- tation framework. In James P. Delgrande and Wolfgang Faber, editors, Proc. LPNMR, volume 6645 of Lecture Notes in Computer Science, pages 40-53. Springer, 2011.","title":"Splitting an argumentation framework","authors":"Ringo Baumann","year":"2011","venue":"Proc. LPNMR","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Baumann, 2012] Ringo Baumann. Normal and strong ex- pansion equivalence for argumentation frameworks. Artif. Intell., 193:18-44, 2012.","title":"Normal and strong expansion equivalence for argumentation frameworks","authors":"Baumann","year":"2012","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Baumann, 2014] Ringo Baumann. Context-free and context-sensitive kernels: Update and deletion equivalence in abstract argumentation. In Torsten Schaub, Gerhard Friedrich, and Barry O'Sullivan, editors, Proc. ECAI, vol- ume 263 of Frontiers in Artificial Intelligence and Appli- cations, pages 63-68. IOS Press, 2014.","title":"Context-free and context-sensitive kernels: Update and deletion equivalence in abstract argumentation","authors":"Ringo Baumann, Baumann","year":"2014","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Bench-Capon and Dunne, 2007] Trevor J. M. Bench-Capon and Paul E. Dunne. Argumentation in artificial intelli- gence. Artif. Intell., 171(10-15):619-641, 2007.","title":"Argumentation in artificial intelligence","authors":"J M Trevor, Paul E Bench-Capon, Dunne","year":"2007","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Charwat, 2012] Günther Charwat. Tree-decomposition based algorithms for abstract argumentation frameworks. Master's thesis, TU Wien, 2012.","title":"Tree-decomposition based algorithms for abstract argumentation frameworks","authors":"Günther Charwat","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"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":17,"raw":"[Dunne and Bench-Capon, 2002] Paul E. Dunne and Trevor J. M. Bench-Capon. Coherence in finite argument systems. Artif. Intell., 141(1/2):187-203, 2002.","title":"Coherence in finite argument systems","authors":"Paul E Dunne, Trevor J M Bench-Capon","year":"2002","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Dunne and Wooldridge, 2009] Paul E. Dunne and Michael Wooldridge. Complexity of abstract argumentation. In Iyad Rahwan and Guillermo R. Simari, editors, Argumen- tation in Artificial Intelligence, pages 85-104. Springer, 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":19,"raw":"[Dvořák and Woltran, 2011] Wolfgang Dvořák and Stefan Woltran. On the intertranslatability of argumentation se- mantics. J. Artif. Intell. Res. (JAIR), 41:445-475, 2011.","title":"On the intertranslatability of argumentation semantics","authors":"Woltran Dvořák, Wolfgang Dvořák, Stefan Woltran","year":"2011","venue":"J. Artif. Intell. Res. (JAIR)","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Dvořák et al., 2012] Wolfgang Dvořák, Reinhard Pichler, and Stefan Woltran. Towards fixed-parameter tractable al- gorithms for abstract argumentation. Artif. Intell., 186:1 - 37, 2012.","title":"Towards fixed-parameter tractable algorithms for abstract argumentation","authors":"Dvořák","year":"2012","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Eiter et al., 2007] Thomas Eiter, Michael Fink, and Stefan Woltran. Semantical characterizations and complexity of equivalences in answer set programming. ACM Trans. Comput. Log., 8(3), 2007.","title":"Semantical characterizations and complexity of equivalences in answer set programming","authors":"Thomas Eiter, Michael Fink, Stefan Woltran","year":"2007","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Giacomin et al., 2016] Massimiliano Giacomin, Thomas Linsbichler, and Stefan Woltran. On the functional com- pleteness of argumentation semantics. In Chitta Baral, James P. Delgrande, and Frank Wolter, editors, Proc. KR, pages 43-52. AAAI Press, 2016.","title":"On the functional completeness of argumentation semantics","authors":"Massimiliano Giacomin, Thomas Linsbichler, Stefan Woltran","year":"2016","venue":"Proc. KR","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Lonc and Truszczyński, 2011] Zbigniew Lonc and Mirosław Truszczyński. On graph equivalences preserved under extensions. Discrete Mathematics, 311(12):966- 977, 2011.","title":"On graph equivalences preserved under extensions","authors":"Zbigniew Lonc, Mirosław Truszczyński","year":"2011","venue":"Discrete Mathematics","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Oikarinen and Woltran, 2011] Emilia Oikarinen and Stefan Woltran. Characterizing strong equivalence for argumen- tation frameworks. Artif. Intell., 175(14-15):1985-2009, 2011.","title":"Characterizing strong equivalence for argumentation frameworks","authors":"Woltran Oikarinen, Emilia Oikarinen, Stefan Woltran","year":"2011","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Rahwan and Simari, 2009] Iyad Rahwan and Guillermo R. Simari. 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}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}