{"type":"ScholarlyArticle","title":"Preferred Reasoning in ABA by Cycle-Breaking","authors":[{"name":"Kiet Nguyen Anh","slug":"kiet-nguyen-anh","given":"Kiet","family":"Nguyen Anh","affiliation":"ScaDS.AI Dresden/ Leipzig , Leipzig University"},{"name":"Markus Ulbricht","slug":"markus-ulbricht","given":"Markus","family":"Ulbricht","affiliation":"ScaDS.AI Dresden/ Leipzig , Leipzig University"}],"abstract":"We develop a fixed-parameter tractable (FPT) algorithm for skeptical preferred reasoning in assumption-based argumentation (ABA). To this end we make use of so-called backdoors, i.e. sets of assumptions that need to be evaluated s.t. the remaining ABA framework (ABAF) belongs to a computational beneficial sub-class. In order to identify such target classes, we employ a suitable notion of a dependency graph of an ABAF. We show that these graphs can be constructed in polynomial time and that one can efficiently check sufficient properties ensuring that reasoning in the underlying ABAF is tractable. After establishing the theoretical foundations, we test our implementation against the ASPforABA solver which convincingly won the ABA track of the ICCMA'23 competition. As it turns out, our algorithm outperforms ASPforABA on instances with small backdoor sizes.","doi":"10.24963/ijcai.2024/390","url":"https://ijcai.org/proceedings/2024/390","pdf":"https://ijcai.org/proceedings/2024/0390.pdf","markdown":"https://ijcai.org/proceedings/2024/390.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/390","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Knowledge Representation and Reasoning","track":"Main Track","number":390,"pages":{"first":3523,"last":3531},"keywords":["Knowledge Representation and Reasoning: KRR: Computational complexity of reasoning","Knowledge Representation and Reasoning: KRR: Argumentation"],"videos":[],"references":[{"position":1,"raw":"[Alfano et al., 2021] 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":2,"raw":"[Alfano et al., 2023] Gianvincenzo Alfano, Marco Calautti, Sergio Greco, Francesco Parisi, and Irina Trubitsyna. Explainable acceptance in probabilistic and incom- plete abstract argumentation frameworks. Artif. Intell., 323:103967, 2023.","title":"Explainable acceptance in probabilistic and incomplete abstract argumentation frameworks","authors":"Alfano","year":"2023","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Apt and Bol, 1994] Krzysztof R. Apt and Roland N. Bol. Logic programming and negation: A survey. J. Log. Pro- gram., 19/20:9-71, 1994.","title":"Logic programming and negation: A survey","authors":"R Krzysztof, Roland N Apt, Bol","year":"1994","venue":"J. Log. Program","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Atkinson et al., 2017] Katie Atkinson, Pietro Baroni, Mas- similiano Giacomin, Anthony Hunter, Henry Prakken, Chris Reed, Guillermo Ricardo Simari, Matthias Thimm, and Serena Villata. Towards artificial argumentation. AI Magazine, 38(3):25-36, 2017.","title":"Towards artificial argumentation","authors":"Katie Atkinson, Pietro Baroni, Massimiliano Giacomin, Anthony Hunter, Henry Prakken, Chris Reed, Guillermo Ricardo Simari, Matthias Thimm, Serena Villata","year":"2017","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Audemard and Simon, 2018] Gilles Audemard and Laurent Simon. On the glucose sat solver. International Journal on Artificial Intelligence Tools, 27(01):1840001, 2018.","title":"On the glucose sat solver","authors":"Simon ; Audemard, Gilles Audemard, Laurent Simon","year":"2018","venue":"International Journal on Artificial Intelligence Tools","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Baroni and Giacomin, 2007] Pietro Baroni and Massim- iliano Giacomin. On principle-based evaluation of extension-based argumentation semantics. Artif. Intell., 171:675-700, 2007.","title":"Pietro Baroni and Massimiliano Giacomin. On principle-based evaluation of extension-based argumentation semantics","authors":"Giacomin Baroni","year":"2007","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":7,"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":8,"raw":"[Baroni et al., 2011] Pietro Baroni, Martin Caminada, and Massimiliano Giacomin. An introduction to argumen- tation semantics. The Knowledge Engineering Review, 26:365-410, 2011.","title":"An introduction to argumentation semantics","authors":"Pietro Baroni, Martin Caminada, Massimiliano Giacomin","year":"2011","venue":"The Knowledge Engineering Review","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Baroni et al., 2018] Pietro Baroni, Dov Gabbay, Massimil- iano Giacomin, and Leendert van der Torre, editors. Hand- book of Formal Argumentation. College Publications, 2018.","title":"Handbook of Formal Argumentation","authors":null,"year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Baumann and Ulbricht, 2019] Ringo Baumann and Markus Ulbricht. If nothing is accepted -repairing argumentation frameworks. J. Artif. Intell. Res., 66:1099-1145, 2019.","title":"If nothing is accepted -repairing argumentation frameworks","authors":"Ulbricht Baumann, Ringo Baumann, Markus Ulbricht","year":"2019","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Baumann and Ulbricht, 2021a] Ringo Baumann and Markus Ulbricht. Choices and their consequences - explaining acceptable sets in abstract argumentation frameworks. In Proc. KR, pages 110-119, 2021.","title":"Choices and their consequencesexplaining acceptable sets in abstract argumentation frameworks","authors":"Ulbricht Baumann, Ringo Baumann, Markus Ulbricht","year":"2021","venue":"Proc. KR","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Baumann and Ulbricht, 2021b] Ringo Baumann and Markus Ulbricht. On cycles, attackers and supporters -A contribution to the investigation of dynamics in abstract argumentation. In Proc. IJCAI, pages 1780-1786.","title":"On cycles, attackers and supporters -A contribution to the investigation of dynamics in abstract argumentation","authors":"Ulbricht Baumann, Ringo Baumann, Markus Ulbricht","year":"2021","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2021/245"},{"position":13,"raw":"[Baumann et al., 2020] Ringo Baumann, Gerhard Brewka, and Markus Ulbricht. Comparing Weak Admissibility Se- mantics to their Dung-style Counterparts -Reduct, Mod- ularization, and Strong Equivalence in Abstract Argumen- tation. In Proc. KR, pages 79-88, 9 2020.","title":"Comparing Weak Admissibility Semantics to their Dung-style Counterparts -Reduct, Modularization, and Strong Equivalence in Abstract Argumentation","authors":"Baumann","year":"2020","venue":"Proc. KR","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Baumann et al., 2022] Ringo Baumann, Gerhard Brewka, and Markus Ulbricht. Shedding new light on the founda- tions of abstract argumentation: Modularization and weak admissibility. Artif. Intell., 310:103742, 2022.","title":"Shedding new light on the foundations of abstract argumentation: Modularization and weak admissibility","authors":"Baumann","year":"2022","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Baumann, 2011] Ringo Baumann. Splitting an argumenta- tion framework. In Proc. LPNMR, volume 6645 of Lecture Notes in Computer Science, pages 40-53. Springer, 2011.","title":"Splitting an argumentation framework","authors":"Ringo Baumann, Baumann","year":"2011","venue":"Proc. LPNMR","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Besnard and Hunter, 2008] Philippe Besnard and Anthony Hunter. Elements of Argumentation. MIT Press, 2008.","title":"Elements of Argumentation","authors":"Philippe Besnard, Anthony Hunter","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Besnard et al., 2014] Philippe Besnard, Alejandro Gar- cia, Anthony Hunter, Sanjay Modgil, Henry Prakken, Guillermo Simari, and Francesca Toni. Introduction to structured argumentation. Argument Comput., 5(1):1-4, 2014.","title":"Introduction to structured argumentation","authors":"Philippe Besnard, Alejandro Garcia, Anthony Hunter, Sanjay Modgil, Henry Prakken, Guillermo Simari, Francesca Toni","year":"2014","venue":"Argument Comput","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Bondarenko et al., 1997] Andrei Bondarenko, Phan Minh Dung, Robert A. Kowalski, and Francesca Toni. An ab- stract, argumentation-theoretic approach to default reason- ing. Artif. Intell., 93:63-101, 1997.","title":"An abstract, argumentation-theoretic approach to default reasoning","authors":"Andrei Bondarenko, Minh Phan, Robert A Dung, Francesca Kowalski, Toni","year":"1997","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Craven and Toni, 2016] Robert Craven and Francesca Toni. Argument graphs and assumption-based argumentation. Artif. Intell., 233:1-59, 2016.","title":"Argument graphs and assumption-based argumentation","authors":"Robert Craven, Francesca Toni","year":"2016","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Čyras et al., 2018] Kristijonas Čyras, Xiuyi Fan, Claudia Schulz, and Francesca Toni. Assumption-based argumen- tation: Disputes, explanations, preferences. In Handbook of Formal Argumentation, chapter 7, pages 365-408. Col- lege Publications, 2018.","title":"and Francesca Toni. Assumption-based argumentation: Disputes, explanations, preferences","authors":"Čyras","year":"2018","venue":"Handbook of Formal Argumentation","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Cyras et al., 2021] Kristijonas Cyras, Antonio Rago, Emanuele Albini, Pietro Baroni, and Francesca Toni. Argumentative XAI: A survey. In Proc. IJCAI, pages 4392-4399. ijcai.org, 2021.","title":"Argumentative XAI: A survey","authors":"Cyras","year":"2021","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2021/600"},{"position":22,"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-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":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Dunne, 2007] Paul E. Dunne. Computational properties of argument systems satisfying graph-theoretic constraints. Artif. Intell., 171(10-15):701-729, 2007.","title":"Computational properties of argument systems satisfying graph-theoretic constraints","authors":"Paul E Dunne","year":"2007","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Dvorák and Dunne, 2018] Wolfgang Dvorák and Paul E. Dunne. Computational problems in formal argumentation and their complexity. In Handbook of Formal Argumenta- tion. College Publications, February 2018.","title":"Computational problems in formal argumentation and their complexity","authors":"Dunne Dvorák, Wolfgang Dvorák, Paul E Dunne","year":"2018","venue":"Handbook of Formal Argumentation","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Dvorák et al., 2012a] Wolfgang Dvorák, Sebastian Ordy- niak, and Stefan Szeider. Augmenting tractable fragments of abstract argumentation. Artif. Intell., 186:157-173, 2012.","title":"Augmenting tractable fragments of abstract argumentation","authors":"Dvorák","year":"2012","venue":"Artif. Intell","doi":null,"url":null,"internal_url":"/proceedings/2011/177"},{"position":26,"raw":"[Dvorák et al., 2012b] Wolfgang Dvorá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":"Dvorák","year":"2012","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Dvorák et al., 2022a] Wolfgang Dvorák, Markus Hecher, Matthias König, André Schidler, Stefan Szeider, and Stefan Woltran. Tractable abstract argumentation via backdoor-treewidth. In Proc. AAAI, pages 5608-5615. AAAI Press, 2022.","title":"Tractable abstract argumentation via backdoor-treewidth","authors":"Dvorák","year":"2022","venue":"Proc. AAAI","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Dvorák et al., 2022b] Wolfgang Dvorák, Matthias König, and Stefan Woltran. Deletion-backdoors for argumenta- tion frameworks with collective attacks. In Proc. SAFA, volume 3236 of CEUR Workshop Proceedings, pages 98- 110. CEUR-WS.org, 2022. [Eén and Sörensson, 2004] Niklas Eén and Niklas Sörensson. An extensible sat-solver. In Theory and Applications of Satisfiability Testing, pages 502-518, Berlin, Heidelberg, 2004. Springer Berlin Heidelberg.","title":"Deletion-backdoors for argumentation frameworks with collective attacks","authors":"Dvorák","year":"2004","venue":"Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Falappa et al., 2009] Marcelo Alejandro Falappa, Gabriele Kern-Isberner, and Guillermo Ricardo Simari. Belief revi- sion and argumentation theory. In Argumentation in Arti- ficial Intelligence, pages 341-360. 2009.","title":"Belief revision and argumentation theory","authors":"Alejandro Marcelo, Gabriele Falappa, Guillermo Ricardo Kern-Isberner, Simari","year":"2009","venue":"Argumentation in Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[García and Simari, 2004] Alejandro Javier García and Guillermo Ricardo Simari. Defeasible logic program- ming: An argumentative approach. Theory Pract. Log. Program., 4(1-2):95-138, 2004.","title":"Alejandro Javier García and Guillermo Ricardo Simari. Defeasible logic programming: An argumentative approach","authors":"Simari García","year":"2004","venue":"Theory Pract. Log. Program","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Gebser et al., 2018] Martin Gebser, Roland Kaminski, Ben- jamin Kaufmann, and Torsten Schaub. Multi-shot asp solving with clingo, 2018.","title":"Multi-shot asp solving with clingo","authors":"Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Torsten Schaub","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Haret et al., 2018] Adrian Haret, Johannes Peter Wallner, and Stefan Woltran. Two sides of the same coin: Belief revision and enforcing arguments. In Proc. IJCAI, pages 1854-1860, 2018.","title":"Two sides of the same coin: Belief revision and enforcing arguments","authors":"Adrian Haret, Johannes Peter Wallner, Stefan Woltran","year":"2018","venue":"Proc. IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/256"},{"position":33,"raw":"[Ignatiev et al., 2018] Alexey Ignatiev, Antonio Morgado, and Joao Marques-Silva. PySAT: A Python toolkit for pro- totyping with SAT oracles. In SAT, pages 428-437, 2018.","title":"PySAT: A Python toolkit for prototyping with SAT oracles","authors":"Alexey Ignatiev, Antonio Morgado, Joao Marques-Silva","year":"2018","venue":"SAT","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[König et al., 2022] Matthias König, Anna Rapberger, and Markus Ulbricht. Just a matter of perspective. In Proc. COMMA, volume 353 of Frontiers in Artificial Intelli- gence and Applications, pages 212-223. IOS Press, 2022.","title":"Just a matter of perspective","authors":"Matthias König, Anna Rapberger, Markus Ulbricht","year":"2022","venue":"Frontiers in Artificial Intelligence and Applications","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Lehtonen et al., 2021] Tuomo Lehtonen, Johannes Peter Wallner, and Matti Järvisalo. Harnessing incremental an- swer set solving for reasoning in assumption-based argu- mentation. CoRR, abs/2108.04192, 2021.","title":"Harnessing incremental answer set solving for reasoning in assumption-based argumentation","authors":"Lehtonen","year":"2021","venue":null,"doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Lehtonen et al., 2023] Tuomo Lehtonen, Anna Rapberger, Markus Ulbricht, and Johannes Peter Wallner. Argumen- tation frameworks induced by assumption-based argumen- tation: Relating size and complexity. In Proc. KR, pages 440-450, 2023.","title":"Argumentation frameworks induced by assumption-based argumentation: Relating size and complexity","authors":"Tuomo Lehtonen, Anna Rapberger, Markus Ulbricht, Johannes Peter, Wallner","year":"2023","venue":"Proc. KR","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Liao et al., 2018] Beishui Liao, Kang Xu, and Huaxin Huang. Formulating semantics of probabilistic argumen- tation by characterizing subgraphs: theory and empirical results. J. Log. Comput., 28(2):305-335, 2018.","title":"Formulating semantics of probabilistic argumentation by characterizing subgraphs: theory and empirical results","authors":"Liao","year":"2018","venue":"J. Log. Comput","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Liao, 2013] Beishui Liao. Toward incremental computation of argumentation semantics: A decomposition-based ap- proach. Ann. Math. Artif. Intell., 67(3-4):319-358, 2013.","title":"Toward incremental computation of argumentation semantics: A decomposition-based approach","authors":"Beishui Liao, Liao","year":"2013","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Liao, 2014] Beishui Liao. Efficient Computation of Argu- mentation Semantics. Intelligent systems series. Academic Press, 2014.","title":"Efficient Computation of Argumentation Semantics","authors":"Beishui Liao, Liao","year":"2014","venue":"Intelligent systems series","doi":null,"url":null,"internal_url":null},{"position":40,"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":"Sanjay Modgil, Henry Prakken","year":"2013","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Niskanen et al., 2018] Andreas Niskanen, Johannes Peter Wallner, and Matti Järvisalo. Extension enforcement un- der grounded semantics in abstract argumentation. In Proc. KR, pages 178-183, 2018.","title":"Extension enforcement under grounded semantics in abstract argumentation","authors":"Andreas Niskanen, Johannes Peter Wallner, Matti Järvisalo","year":"2018","venue":"Proc. KR","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Popescu and Wallner, 2023] Andrei Popescu and Jo- hannes Peter Wallner. Reasoning in assumption-based argumentation using tree-decompositions. In Proc. JELIA, volume 14281 of Lecture Notes in Computer Science, pages 192-208. Springer, 2023.","title":"Reasoning in assumption-based argumentation using tree-decompositions","authors":"Wallner Popescu, Andrei Popescu, Johannes Peter, Wallner","year":"2023","venue":"Proc. JELIA","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"[Rapberger et al., 2022] Anna Rapberger, Markus Ulbricht, and Johannes Peter Wallner. Argumentation frameworks induced by assumption-based argumentation: Relating size and complexity. In Proc. NMR, volume 3197 of CEUR Workshop Proceedings, pages 92-103. CEUR-WS.org, 2022.","title":"Argumentation frameworks induced by assumption-based argumentation: Relating size and complexity","authors":"Anna Rapberger, Markus Ulbricht, Johannes Peter, Wallner","year":"2022","venue":"CEUR Workshop Proceedings","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Schulz and Toni, 2017] Claudia Schulz and Francesca Toni. Labellings for assumption-based and abstract argumenta- tion. Int. J. Approx. Reason., 84:110-149, 2017.","title":"Labellings for assumption-based and abstract argumentation","authors":"Claudia Schulz, Francesca Toni","year":"2017","venue":"Int. J. Approx. Reason","doi":null,"url":null,"internal_url":null},{"position":45,"raw":"[Wallner et al., 2017] Johannes Peter Wallner, Andreas Niskanen, and Matti Järvisalo. Complexity results and algorithms for extension enforcement in abstract argumentation. J. Artif. Intell. Res., 60:1-40, 2017.","title":"Complexity results and algorithms for extension enforcement in abstract argumentation","authors":"Wallner","year":"2017","venue":"J. Artif. Intell. Res","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}