{"type":"ScholarlyArticle","title":"Inverse Problems for Gradual Semantics","authors":[{"name":"Nir Oren","slug":"nir-oren","given":"Nir","family":"Oren","affiliation":"University of Aberdeen"},{"name":"Bruno Yun","slug":"bruno-yun","given":"Bruno","family":"Yun","affiliation":"University of Aberdeen"},{"name":"Srdjan Vesic","slug":"srdjan-vesic","given":"Srdjan","family":"Vesic","affiliation":"CNRS , Univ. Artois , CRIL , France"},{"name":"Murilo Baptista","slug":"murilo-baptista","given":"Murilo","family":"Baptista","affiliation":"University of Aberdeen"}],"abstract":"Gradual semantics with abstract argumentation provide each argument with a score reflecting its acceptability. Many different gradual semantics have been proposed in the literature, each following different principles and producing different argument rankings. A sub-class of such semantics, the so-called weighted semantics, takes, in addition to the graph structure, an initial set of weights over the arguments as input, with these weights affecting the resultant argument ranking. In this work, we consider the inverse problem over such weighted semantics. That is, given an argumentation framework and a desired argument ranking, we ask whether there exist initial weights such that a particular semantics produces the given ranking. The contribution of this paper are: (1) an algorithm to answer this problem, (2) a characterisation of the properties that a gradual semantics must satisfy for the algorithm to operate, and (3) an empirical evaluation of the proposed algorithm.","doi":"10.24963/ijcai.2022/377","url":"https://ijcai.org/proceedings/2022/377","pdf":"https://ijcai.org/proceedings/2022/0377.pdf","markdown":"https://ijcai.org/proceedings/2022/377.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/377","volume":{"slug":"2022","title":"Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2022","url":"https://ijcai.org/proceedings/2022/","year":2022,"location":"Vienna","dates":"23-29 July 2022","editors":"Luc De Raedt","isbn":"978-1-956792-00-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2022"},"section":"Knowledge Representation and Reasoning","track":"Main Track","number":377,"pages":{"first":2719,"last":2725},"keywords":["Knowledge Representation and Reasoning: Argumentation","Agent-based and Multi-agent Systems: Agreement Technologies: Argumentation"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986560","length_sec":89,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38984703","length_sec":358,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Amgoud and Ben-Naim, 2013] Leila Amgoud and Jonathan Ben-Naim. Ranking-Based Semantics for Argumentation Frameworks. In Proc. Scalable Uncer- tainty Management, pages 134-147, 2013.","title":"Leila Amgoud and Jonathan Ben-Naim. Ranking-Based Semantics for Argumentation Frameworks","authors":"Ben-Naim Amgoud","year":"2013","venue":"Proc. Scalable Uncertainty Management","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Amgoud et al., 2016] Leila Amgoud, Jonathan Ben-Naim, Dragan Doder, and Srdjan Vesic. Ranking Arguments With Compensation-Based Semantics. In KR 2016, pages 12-21, 2016.","title":"Ranking Arguments With Compensation-Based Semantics","authors":"Leila Amgoud, Jonathan Ben-Naim, Dragan Doder, Srdjan Vesic","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Amgoud et al., 2017] Leila Amgoud, Jonathan Ben-Naim, Dragan Doder, and Srdjan Vesic. Acceptability Semantics for Weighted Argumentation Frameworks. In IJCAI, pages 56-62, 2017.","title":"Acceptability Semantics for Weighted Argumentation Frameworks","authors":"Leila Amgoud, Jonathan Ben-Naim, Dragan Doder, Srdjan Vesic","year":"2017","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2017/9"},{"position":4,"raw":"[Amgoud et al., 2022] Leila Amgoud, Dragan Doder, and Srdjan Vesic. Evaluation of argument strength in attack graphs: Foundations and semantics. Artificial Intelligence, 302:103607, 2022.","title":"Evaluation of argument strength in attack graphs: Foundations and semantics","authors":"Leila Amgoud, Dragan Doder, Srdjan Vesic","year":"2022","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":5,"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":6,"raw":"[Bonzon et al., 2016] Elise Bonzon, Jérôme Delobelle, Sébastien Konieczny, and Nicolas Maudet. A Compar- ative Study of Ranking-Based Semantics for Abstract Argumentation. In Proc. AAAI, pages 914-920, 2016.","title":"A Comparative Study of Ranking-Based Semantics for Abstract Argumentation","authors":"Elise Bonzon, Jérôme Delobelle, Sébastien Konieczny, Nicolas Maudet","year":"2016","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Brent, 2013] Richard P Brent. Algorithms for minimization without derivatives. Courier Corporation, 2013.","title":"Algorithms for minimization without derivatives","authors":"P Richard, Brent","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Caminada et al., 2012] Martin W. A. Caminada, Wal- ter Alexandre Carnielli, and Paul E. Dunne. Semi-stable semantics. J. Log. Comput., 22(5):1207-1254, 2012.","title":"Semi-stable semantics","authors":"W A Martin, Walter Alexandre Caminada, Paul E Carnielli, Dunne","year":"2012","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Coste-Marquis et al., 2012] Sylvie Coste-Marquis, Sébastien Konieczny, Pierre Marquis, and Mohand Akli Ouali. Weighted Attacks in Argumentation Frameworks. In KR 2012, 2012.","title":"Weighted Attacks in Argumentation Frameworks","authors":"Sylvie Coste-Marquis, Sébastien Konieczny, Pierre Marquis, Mohand Akli, Ouali","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[da Costa Pereira et al., 2011] Célia da Costa Pereira, An- drea Tettamanzi, and Serena Villata. Changing one's mind: Erase or rewind? In IJCAI, pages 164-171, 2011.","title":"Célia da Costa Pereira, Andrea Tettamanzi, and Serena Villata. Changing one's mind: Erase or rewind?","authors":"Costa Da, Pereira","year":"2011","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Dekker, 1969] TJ Dekker. Finding a zero by means of suc- cessive linear interpolation, constructive aspects of the fundamental theorem of algebra (B. Dejon and P. Henrici, eds.), 1969. [Delobelle, 2017] Jérôme Delobelle. Ranking-based Seman- tics for Abstract Argumentation. PhD thesis, Université d'Artois, 2017.","title":"Finding a zero by means of successive linear interpolation, constructive aspects of the fundamental theorem of algebra","authors":"Tj Dekker","year":"1969","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"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. 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":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 et al., 2015] Paul E. Dunne, Wolfgang Dvorák, Thomas Linsbichler, and Stefan Woltran. Characteristics of multiple viewpoints in abstract argumentation. Artif. Intell., 228:153-178, 2015.","title":"Characteristics of multiple viewpoints in abstract argumentation","authors":"Paul E Dunne, Wolfgang Dvorák, Thomas Linsbichler, Stefan Woltran","year":"2015","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gabbay and Rodrigues, 2015] Dov M. Gabbay and Odi- naldo Rodrigues. Equilibrium states in numerical argu- mentation networks. Logica Universalis, 9(4):411-473, 2015.","title":"Equilibrium states in numerical argumentation networks","authors":"Dov M Gabbay, Odinaldo Rodrigues","year":"2015","venue":"Logica Universalis","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Hunter and Thimm, 2017] Anthony Hunter and Matthias Thimm. Probabilistic reasoning with abstract argumen- tation frameworks. J. Artif. Intell. Res., 59:565-611, 2017.","title":"Probabilistic reasoning with abstract argumentation frameworks","authors":"Anthony Hunter, Matthias Thimm","year":"2017","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Li et al., 2011] Hengfei Li, Nir Oren, and Timothy J. Nor- man. Probabilistic argumentation frameworks. In TAFA, volume 7132 of Lecture Notes in Computer Science, pages 1-16, 2011.","title":"Probabilistic argumentation frameworks","authors":"Hengfei Li, Nir Oren, Timothy J","year":"2011","venue":"TAFA","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Mahesar et al., 2018] Quratul-ain Mahesar, Nir Oren, and Wamberto W. Vasconcelos. Computing preferences in ab- stract argumentation. In Proc. PRIMA, pages 387-402, 2018.","title":"Wamberto W. Vasconcelos. Computing preferences in abstract argumentation","authors":"Mahesar","year":"2018","venue":"Proc. PRIMA","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Mossakowski and Neuhaus, 2016] Till Mossakowski and Fabian Neuhaus. Bipolar Weighted Argumentation Graphs. CoRR, abs/1611.08572, 2016.","title":"Till Mossakowski and Fabian Neuhaus","authors":"Neuhaus Mossakowski","year":"2016","venue":"Bipolar Weighted Argumentation Graphs","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Mossakowski and Neuhaus, 2018] Till Mossakowski and Fabian Neuhaus. Modular Semantics and Characteris- tics for Bipolar Weighted Argumentation Graphs. CoRR, abs/1807.06685, 2018.","title":"Till Mossakowski and Fabian Neuhaus. Modular Semantics and Characteristics for Bipolar Weighted Argumentation Graphs","authors":"Neuhaus Mossakowski","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Polberg and Hunter, 2018] Sylwia Polberg and Anthony Hunter. Empirical evaluation of abstract argumentation: Supporting the need for bipolar and probabilistic ap- proaches. International Journal of Approximate Reason- ing, 93:487-543, 2018.","title":"Empirical evaluation of abstract argumentation: Supporting the need for bipolar and probabilistic approaches","authors":"Sylwia Polberg, Anthony Hunter","year":"2018","venue":"International Journal of Approximate Reasoning","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Rago et al., 2016] Antonio Rago, Francesca Toni, Marco Aurisicchio, and Pietro Baroni. Discontinuity-Free De- cision Support with Quantitative Argumentation Debates. In KR 2016, pages 63-73, 2016.","title":"Discontinuity-Free Decision Support with Quantitative Argumentation Debates","authors":"Rago","year":"2016","venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Tang et al., 2016] Yuqing Tang, Nir Oren, and Katia Sycara. Markov argumentation random fields. In Proceedings of AAAI Conference on Artificial Intelligence, 2016.","title":"Markov argumentation random fields","authors":"Yuqing Tang, Nir Oren, Katia Sycara","year":"2016","venue":"Proceedings of AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Verbeke and Cools, 1995] Johan Verbeke and Ronald Cools. The newton-raphson method. International Journal of Mathematical Education in Science and Technology, 26(2):177-193, 1995.","title":"The newton-raphson method","authors":"Cools Verbeke, Johan Verbeke, Ronald Cools","year":"1995","venue":"International Journal of Mathematical Education in Science and Technology","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Wu et al., 2016] Jiachao Wu, Hengfei Li, Nir Oren, and Timothy J. Norman. Gödel fuzzy argumentation frame- works. In COMMA, volume 287 of Frontiers in Artificial Intelligence and Applications, pages 447-458. IOS Press, 2016.","title":"Gödel fuzzy argumentation frameworks","authors":"Wu","year":"2016","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Yun and Vesic, 2021] Bruno Yun and Srdjan Vesic. Grad- ual semantics for weighted bipolar setafs. In ECSQARU 2021, volume 12897 of Lecture Notes in Computer Sci- ence, pages 201-214. Springer, 2021.","title":"Gradual semantics for weighted bipolar setafs","authors":"Yun, Vesic, Bruno Yun, Srdjan Vesic","year":"2021","venue":"ECSQARU 2021","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Yun et al., 2020] Bruno Yun, Srdjan Vesic, and Madalina Croitoru. Ranking-Based Semantics for Sets of Attacking Arguments. In AAAI 2020, pages 3033-3040, 2020.","title":"Ranking-Based Semantics for Sets of Attacking Arguments","authors":"Bruno Yun, Srdjan Vesic, Madalina Croitoru","year":"2020","venue":"AAAI 2020","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}