{"type":"ScholarlyArticle","title":"On Preferences and Priority Rules in Abstract Argumentation","authors":[{"name":"Gianvincenzo Alfano","slug":"gianvincenzo-alfano","given":"Gianvincenzo","family":"Alfano","affiliation":"DIMES Department , University of Calabria , Rende , Italy"},{"name":"Sergio Greco","slug":"sergio-greco","given":"Sergio","family":"Greco","affiliation":"DIMES Department , University of Calabria , Rende , Italy"},{"name":"Francesco Parisi","slug":"francesco-parisi","given":"Francesco","family":"Parisi","affiliation":"DIMES Department , University of Calabria , Rende , Italy"},{"name":"Irina Trubitsyna","slug":"irina-trubitsyna","given":"Irina","family":"Trubitsyna","affiliation":"DIMES Department , University of Calabria , Rende , Italy"}],"abstract":"Dung's abstract Argumentation Framework (AF) has emerged as a central formalism for argumentation in AI. \r\nPreferences in AF allow to represent the comparative strength of arguments in a simple yet expressive way.\r\nIn this paper we first investigate the complexity of the verification as well as credulous and skeptical acceptance problems in Preference-based AF (PAF) that extends AF with preferences over arguments. \r\nNext, after introducing new semantics for AF where extensions are selected using cardinality (instead of set inclusion) criteria and investigating their complexity, we introduce a framework called AF with Priority rules (AFP) that extends AF with sequences of priority rules.\r\nAFP generalizes AF with classical set-inclusion and cardinality based semantics, suggesting that argumentation semantics can be viewed as ways to express priorities among extensions.\r\nFinally, we extend AFP by proposing AF with Priority rules and Preferences (AFP^2), where also preferences over arguments can be used to define priority rules, and study the complexity of the above-mentioned problems.","doi":"10.24963/ijcai.2022/349","url":"https://ijcai.org/proceedings/2022/349","pdf":"https://ijcai.org/proceedings/2022/0349.pdf","markdown":"https://ijcai.org/proceedings/2022/349.md","bibtex":"https://ijcai.org/proceedings/2022/bibtex/349","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":349,"pages":{"first":2517,"last":2524},"keywords":["Knowledge Representation and Reasoning: Argumentation"],"videos":[{"label":"Video #1","url":"https://slideslive.com/38986854","length_sec":87,"provider":"slideslive"},{"label":"Video #2","url":"https://slideslive.com/38984997","length_sec":351,"provider":"slideslive"}],"references":[{"position":1,"raw":"[Alfano et al., 2020a] G. Alfano, M. Calautti, S. Greco, F. Parisi, and I. Trubitsyna. Explainable acceptance in probabilistic abstract argumentation: Complexity and ap- proximation. In Proc. of KR, pages 33-43, 2020.","title":"Explainable acceptance in probabilistic abstract argumentation: Complexity and approximation","authors":"Alfano","year":"2020","venue":"Proc. of KR","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Alfano et al., 2020b] Gianvincenzo Alfano, Sergio Greco, Francesco Parisi, and Irina Trubitsyna. On the semantics of abstract argumentation frameworks: A logic program- ming approach. TPLP, 20(5):703-718, 2020.","title":"On the semantics of abstract argumentation frameworks: A logic programming approach","authors":"Alfano","year":"2020","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Alfano et al., 2021a] Gianvincenzo Alfano, Sergio Greco, Francesco Parisi, Gerardo I. Simari, and Guillermo Ri- cardo Simari. Incremental computation for structured ar- gumentation over dynamic DeLP knowledge bases. Artif. Intell., 300:103553, 2021.","title":"Incremental computation for structured argumentation over dynamic DeLP knowledge bases","authors":"Alfano","year":"2021","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Alfano et al., 2021b] Gianvincenzo Alfano, Sergio Greco, Francesco Parisi, and Irina Trubitsyna. Argumentation frameworks with strong and weak constraints: Semantics and complexity. In Proc. of AAAI, pages 6175-6184, 2021.","title":"Argumentation frameworks with strong and weak constraints: Semantics and complexity","authors":"Alfano","year":"2021","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Alfano et al., 2022] Gianvincenzo Alfano, Sergio Greco, Francesco Parisi, and Irina Trubitsyna. Incomplete argumentation frameworks: Properties and complexity. Preprint of AAAI, https://tinyurl.com/ycyt7bas, 2022.","title":"Incomplete argumentation frameworks: Properties and complexity","authors":"Alfano","year":"2022","venue":"Preprint of AAAI","doi":null,"url":"https://tinyurl.com/ycyt7bas,2022","internal_url":null},{"position":6,"raw":"[Amgoud and Cayrol, 1998] L. Amgoud and C. Cayrol. On the acceptability of arguments in preference-based argu- mentation. In Proc. of UAI, pages 1-7, 1998.","title":"On the acceptability of arguments in preference-based argumentation","authors":"L Amgoud, C Cayrol","year":"1998","venue":"Proc. of UAI","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Amgoud and Cayrol, 2002a] Leila Amgoud and Claudette Cayrol. Inferring from inconsistency in preference-based argumentation frameworks. J. Autom. Reason., 29(2):125- 169, 2002.","title":"Inferring from inconsistency in preference-based argumentation frameworks","authors":"Cayrol Amgoud, Leila Amgoud, Claudette Cayrol","year":"2002","venue":"J. Autom. Reason","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Amgoud and Cayrol, 2002b] Leila Amgoud and Claudette Cayrol. A reasoning model based on the production of acceptable arguments. AMAI, 34(1-3):197-215, 2002.","title":"Leila Amgoud and Claudette Cayrol. A reasoning model based on the production of acceptable arguments","authors":"Cayrol Amgoud","year":"2002","venue":"AMAI","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Amgoud and Vesic, 2011] Leila Amgoud and Srdjan Vesic. A new approach for preference-based argumentation fra- meworks. Ann. Math. Artif. Intell., 63(2):149-183, 2011.","title":"Leila Amgoud and Srdjan Vesic. A new approach for preference-based argumentation frameworks","authors":"Vesic Amgoud","year":"2011","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Amgoud and Vesic, 2014] Leila Amgoud and Srdjan Vesic. Rich preference-based argumentation frameworks. Int. J. Approx. Reason., 55(2):585-606, 2014.","title":"Leila Amgoud and Srdjan Vesic. Rich preference-based argumentation frameworks","authors":"Vesic Amgoud","year":"2014","venue":"Int. J. Approx. Reason","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Bench-Capon, 2003] Trevor J. M. Bench-Capon. Persua- sion in practical argument using value-based argumenta- tion frameworks. J. Log. Comput., 13(3):429-448, 2003.","title":"Persuasion in practical argument using value-based argumentation frameworks","authors":"J M Trevor, Bench-Capon","year":"2003","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Bonzon et al., 2016] Elise Bonzon, Jérôme Delobelle, Sébastien Konieczny, and Nicolas Maudet. A com- parative study of ranking-based semantics for abstract argumentation. In Proc. of 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. of AAAI","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Brewka and Eiter, 1999] Gerhard Brewka and Thomas Eiter. Preferred answer sets for extended logic programs. Artif. Intell., 109(1-2):297-356, 1999.","title":"Preferred answer sets for extended logic programs","authors":"Eiter Brewka, Gerhard Brewka, Thomas Eiter","year":"1999","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Brewka et al., 2003] Gerhard Brewka, Ilkka Niemelä, and Miroslaw Truszczynski. Answer set optimization. In Proc. IJCAI, pages 867-872, 2003.","title":"Answer set optimization","authors":"Gerhard Brewka, Ilkka Niemelä, Miroslaw Truszczynski","year":"2003","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Brewka et al., 2015] Gerhard Brewka, James P. Delgrande, Javier Romero, and Torsten Schaub. asprin: Customizing answer set preferences without a headache. In Proc. AAAI, pages 1467-1474, 2015.","title":"asprin: Customizing answer set preferences without a headache","authors":"Gerhard Brewka, James P Delgrande, Javier Romero, Torsten Schaub","year":"2015","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Caminada and Dunne, 2020] Martin Caminada and Paul E. Dunne. Minimal strong admissibility: A complexity anal- ysis. In Proc. of COMMA, pages 135-146, 2020.","title":"Minimal strong admissibility: A complexity analysis","authors":"Martin Caminada, Paul E Dunne","year":"2020","venue":"Proc. of COMMA","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Caminada et al., 2015] Martin Caminada, Samy Sá, João F. L. Alcântara, and Wolfgang Dvorák. On the equivalence between logic programming semantics and argumentation semantics. Int. J. Approx. Reason., 58:87-111, 2015.","title":"On the equivalence between logic programming semantics and argumentation semantics","authors":"Martin Caminada, Samy Sá, F L João, Wolfgang Alcântara, Dvorák","year":"2015","venue":"Int. J. Approx. Reason","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Caminada et al., 2016] Martin W. A. Caminada, Wolfgang Dvorák, and Srdjan Vesic. Preferred semantics as socratic discussion. J. Log. Comput., 26(4):1257-1292, 2016.","title":"Preferred semantics as socratic discussion","authors":"W A Martin, Wolfgang Caminada, Srdjan Dvorák, Vesic","year":"2016","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Caminada, 2006] Martin Caminada. On the issue of rein- statement in argumentation. In JELIA, pages 111-123, 2006.","title":"On the issue of reinstatement in argumentation","authors":"Martin Caminada","year":"2006","venue":"JELIA","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Coste-Marquis et al., 2012] Sylvie Coste-Marquis, Sébastien Konieczny, Pierre Marquis, and Mohand Akli Ouali. Weighted attacks in argumentation frameworks. In Proc. KR, 2012.","title":"Weighted attacks in argumentation frameworks","authors":"Sylvie Coste-Marquis, Sébastien Konieczny, Pierre Marquis, Mohand Akli, Ouali","year":"2012","venue":"Proc. KR","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Cyras, 2016] Kristijonas Cyras. Argumentation-based rea- soning with preferences. In PAAMS, pages 199-210, 2016.","title":"Kristijonas Cyras. Argumentation-based reasoning with preferences","authors":"Cyras","year":"2016","venue":"PAAMS","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[de Saint-Cyr et al., 2016] Florence Dupin de Saint-Cyr, Pierre Bisquert, Claudette Cayrol, and Marie-Christine Lagasquie-Schiex. Argumentation update in YALLA (yet another logic language for argumentation). Int. J. Approx. Reason., 75:57-92, 2016.","title":"Florence Dupin de Saint-Cyr, Pierre Bisquert, Claudette Cayrol, and Marie-Christine Lagasquie-Schiex","authors":"De Saint-Cyr","year":"2016","venue":"Int. J. Approx. Reason","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Delgrande et al., 2003] James P. Delgrande, Torsten Schaub, and Hans Tompits. A framework for compiling preferences in logic programs. TPLP, 3(2):129-187, 2003.","title":"A framework for compiling preferences in logic programs","authors":"James P Delgrande, Torsten Schaub, Hans Tompits","year":"2003","venue":"TPLP","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Dung, 1995] P. M. Dung. On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games. Artif. Intell., 77:321- 358, 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":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Dunne and Bench-Capon, 2004] Paul E. Dunne and Trevor J. M. Bench-Capon. Complexity in value-based argument systems. In Proc. of JELIA, pages 360-371, 2004.","title":"Complexity in value-based argument systems","authors":"Paul E Dunne, Trevor J M Bench-Capon","year":"2004","venue":"Proc. of JELIA","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Dunne et al., 2011] Paul E. Dunne, Anthony Hunter, Peter McBurney, Simon Parsons, and Michael J. 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 J Wooldridge","year":"2011","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Dvorák and Dunne, 2017] Wolfgang Dvorák and Paul E. Dunne. Computational problems in formal argumentation and their complexity. FLAP, 4(8), 2017.","title":"Computational problems in formal argumentation and their complexity","authors":"Dunne Dvorák, Wolfgang Dvorák, Paul E Dunne","year":"2017","venue":"FLAP","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Dvorák and Wallner, 2020] Wolfgang Dvorák and Jo- hannes Peter Wallner. Computing strongly admissible sets. In Proc. of COMMA, pages 179-190, 2020.","title":"Computing strongly admissible sets","authors":"Wallner Dvorák, Wolfgang Dvorák, Johannes Peter, Wallner","year":"2020","venue":"Proc. of COMMA","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Dvorák et al., 2020] Wolfgang Dvorák, Sarah Alice Gaggl, Anna Rapberger, Johannes Peter Wallner, and Stefan Woltran. The ASPARTIX system suite. In Proc. of COMMA, pages 461-462, 2020.","title":"The ASPARTIX system suite","authors":"Dvorák","year":"2020","venue":"Proc. of COMMA","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Eiter et al., 2003] Thomas Eiter, Wolfgang Faber, Nicola Leone, and Gerald Pfeifer. Computing preferred answer sets by meta-interpretation in answer set programming. Theory Pract. Log. Program., 3(4-5):463-498, 2003.","title":"Computing preferred answer sets by meta-interpretation in answer set programming","authors":"Thomas Eiter, Wolfgang Faber, Nicola Leone, Gerald Pfeifer","year":"2003","venue":"Theory Pract. Log. Program","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Fazzinga et al., 2015] Bettina Fazzinga, Sergio Flesca, and Francesco Parisi. On the complexity of probabilistic ab- stract argumentation frameworks. ACM Trans. Comput. Log., 16(3):22:1-22:39, 2015.","title":"On the complexity of probabilistic abstract argumentation frameworks","authors":"Bettina Fazzinga, Sergio Flesca, Francesco Parisi","year":"2015","venue":"ACM Trans. Comput. Log","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Fazzinga et al., 2020] Bettina Fazzinga, Sergio Flesca, and Filippo Furfaro. Revisiting the notion of extension over incomplete abstract argumentation frameworks. In Proc. of IJCAI, pages 1712-1718, 2020.","title":"Revisiting the notion of extension over incomplete abstract argumentation frameworks","authors":"Bettina Fazzinga, Sergio Flesca, Filippo Furfaro","year":"2020","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2020/237"},{"position":33,"raw":"[Gabbay et al., 2021] Dov Gabbay, Massimiliano Giacomin, Guillermo R. Simari, and Matthias Thimm, editors. Hand- book of Formal Argumentation. College Public., 2021.","title":"Handbook of Formal Argumentation","authors":null,"year":"2021","venue":null,"doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Garcia et al., 2020] Alejandro Javier Garcia, Henry Prakken, and Guillermo Ricardo Simari. A comparative study of some central notions of ASPIC+ and DeLP. Theory Pract. Log. Program., 20(3):358-390, 2020.","title":"A comparative study of some central notions of ASPIC+ and DeLP","authors":"Alejandro Javier Garcia, Henry Prakken, Guillermo Ricardo Simari","year":"2020","venue":"Theory Pract. Log. Program","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Greco et al., 2007] Sergio Greco, Irina Trubitsyna, and Es- ter Zumpano. On the semantics of logic programs with preferences. J. Artif. Intell. Res., 30:501-523, 2007.","title":"On the semantics of logic programs with preferences","authors":"Sergio Greco, Irina Trubitsyna, Ester Zumpano","year":"2007","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Heyninck and Strasser, 2021] Jesse Heyninck and Chris- tian Strasser. A comparative study of assumption-based argumentative approaches to reasoning with priorities. FLAP, 8(3):737-808, 2021.","title":"Jesse Heyninck and Christian Strasser. A comparative study of assumption-based argumentative approaches to reasoning with priorities","authors":"Strasser Heyninck","year":"2021","venue":"FLAP","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Kaci et al., 2018] Souhila Kaci, Leendert W. N. van der Torre, and Serena Villata. Preference in abstract argumen- tation. In Proc. COMMA, pages 405-412, 2018.","title":"Preference in abstract argumentation","authors":"Kaci","year":"2018","venue":"Proc. COMMA","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Mailly and Rossit, 2020] Jean-Guy Mailly and Julien Rossit. Argument, I choose you! preferences and ranking semantics in abstract argumentation. In Proc. of KR, pages 647-651, 2020.","title":"Argument, I choose you! preferences and ranking semantics in abstract argumentation","authors":"Jean-Guy Mailly, Julien Rossit","year":"2020","venue":"Proc. of KR","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Modgil and Prakken, 2013] Sanjay Modgil and Henry Prakken. A general account of argumentation with preferences. Artif. Intell., 195:361-397, 2013.","title":"A general account of argumentation with preferences","authors":"Prakken Modgil, Sanjay Modgil, Henry Prakken","year":"2013","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Modgil, 2009] Sanjay Modgil. Reasoning about prefer- ences in argumentation frameworks. Artif. Intell., 173(9- 10):901-934, 2009.","title":"Reasoning about preferences in argumentation frameworks","authors":"Sanjay Modgil","year":"2009","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Papadimitriou, 1994] C. H. Papadimitriou. Computational complexity. Addison-Wesley, 1994.","title":"Computational complexity","authors":"C H Papadimitriou","year":"1994","venue":null,"doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Prakken and Sartor, 1997] Henry Prakken and Giovanni Sartor. Argument-based extended logic programming with defeasible priorities. J. Appl. Non Class. Logics, 7(1):25- 75, 1997.","title":"Argument-based extended logic programming with defeasible priorities","authors":"Sartor Prakken, Henry Prakken, Giovanni Sartor","year":"1997","venue":"J. Appl. Non Class. Logics","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Sakama and Inoue, 2000] Chiaki Sakama and Katsumi In- oue. Prioritized logic programming and its application to commonsense reasoning. Artif. Intell., 123(1-2), 2000.","title":"Chiaki Sakama and Katsumi Inoue. Prioritized logic programming and its application to commonsense reasoning","authors":"Inoue Sakama","year":"2000","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Silva et al., 2020] Rafael Silva, Samy Sá, and João F. L. Alcântara. Semantics hierarchy in preference-based argu- mentation frameworks. In COMMA, pages 339-346, 2020.","title":"Semantics hierarchy in preference-based argumentation frameworks","authors":"Rafael Silva, Samy Sá, F L João, Alcântara","year":"2020","venue":"COMMA","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Toni, 2014] Francesca Toni. A tutorial on assumption-based argumentation. Argument Comput., 5(1):89-117, 2014.","title":"A tutorial on assumption-based argumentation","authors":"Francesca Toni","year":"2014","venue":"Argument Comput","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Wakaki, 2015] Toshiko Wakaki. Preference-based argu- mentation built from prioritized logic programming. J. Log. Comput., 25(2):251-301, 2015.","title":"Preference-based argumentation built from prioritized logic programming","authors":"Toshiko Wakaki","year":"2015","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}