[36] J.P. Wallner, A. Niskanen and M. Järvisalo, Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation, *J. Artif. Intell. Res.* **60** (2017), 1–40.

[37] Y. Dimopoulos, J.-G. Mailly and P. Moraitis, Control Argumentation Frameworks, in: *Proc. of AAAI'18*, 2018, pp. 4678–4685.

[38] A. Herzig and A. Yuste-Ginel, Abstract Argumentation with Qualitative Uncertainty: An Analysis in Dynamic Logic, in: *Logic and Argumentation - 4th International Conference, CLAR 2021, Hangzhou, China, October 20-22, 2021, Proceedings*, P. Baroni, C. Benzmüller and Y.N. Wáng, eds, Lecture Notes in Computer Science, Vol. 13040, Springer, 2021, pp. 190–208.

[39] A. Yuste-Ginel and A. Herzig, Qualitative uncertainty and dynamics of argumentation through dynamic logic, *J. Log. Comput.* **33**(2) (2023), 370–405. doi:10.1093/logcom/exac098.

[40] A. Niskanen, D. Neugebauer and M. Järvisalo, Controllability of Control Argumentation Frameworks, in: *Proc. of IJCAI'20*, 2020, pp. 1855–1861.

[41] J.-G. Mailly, Possible Controllability of Control Argumentation Frameworks, in: *Proc. of COMMA'20*, Vol. 326, 2020, pp. 283–294.

[42] P. Balbiani, A. Herzig and N. Troquard, Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL, in: *28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013*, IEEE Computer Society, 2013, pp. 143–152.

[43] J.-G. Mailly, Yes, no, maybe, I don't know: Complexity and application of abstract argumentation with incomplete knowledge, *Argument Comput.* **13**(3) (2022), 291–324.

[44] J.-G. Mailly, A Logical Encoding for k-m-Realization of Extensions in Abstract Argumentation, in: *Logic and Argumentation - 5th International Conference, CLAR 2023, Hangzhou, China, September 10-12, 2023, Proceedings*, A. Herzig, J. Luo and P. Pardo, eds, Lecture Notes in Computer Science, Vol. 14156, Springer, 2023, pp. 84–100. doi:10.1007/978-3-031-40875-5_6.

[45] G. Brewka, H. Strass, S. Ellmauthaler, J.P. Wallner and S. Woltran, Abstract Dialectical Frameworks Revisited, in: *Proc. of IJCAI'13*, F. Rossi, ed., 2013, pp. 803–809.

[46] J.P. Wallner, Structural constraints for dynamic operators in abstract argumentation, *Argument Comput.* **11**(1–2) (2020), 151–190.

[47] H. Prakken, Formalising an Aspect of Argument Strength: Degrees of Attackability, in: *Computational Models of Argument - Proceedings of COMMA 2022, Cardiff, Wales, UK, 14-16 September 2022*, F. Toni, S. Polberg, R. Booth, M. Caminada and H. Kido, eds, Frontiers in Artificial Intelligence and Applications, Vol. 353, IOS Press, 2022, pp. 296–307.

[48] F. Toni, A tutorial on assumption-based argumentation, *Argument Comput.* **5**(1) (2014), 89–117. doi:10.1080/19462166.2013.869878.

[49] A. Darwiche and P. Marquis, A Knowledge Compilation Map, *J. Artif. Intell. Res.* **17** (2002), 229–264.
[36] J.P. Wallner, A. Niskanen and M. Järvisalo, Complexity Results and Algorithms for Extension Enforcement in Abstract Argumentation, *J. Artif. Intell. Res.* **60** (2017), 1–40.

[37] Y. Dimopoulos, J.-G. Mailly and P. Moraitis, Control Argumentation Frameworks, in: *Proc. of AAAI'18*, 2018, pp. 4678–4685.

[38] A. Herzig and A. Yuste-Ginel, Abstract Argumentation with Qualitative Uncertainty: An Analysis in Dynamic Logic, in: *Logic and Argumentation - 4th International Conference, CLAR 2021, Hangzhou, China, October 20-22, 2021, Proceedings*, P. Baroni, C. Benzmüller and Y.N. Wáng, eds, Lecture Notes in Computer Science, Vol. 13040, Springer, 2021, pp. 190–208.

[39] A. Yuste-Ginel and A. Herzig, Qualitative uncertainty and dynamics of argumentation through dynamic logic, *J. Log. Comput.* **33**(2) (2023), 370–405. doi:10.1093/logcom/exac098.

[40] A. Niskanen, D. Neugebauer and M. Järvisalo, Controllability of Control Argumentation Frameworks, in: *Proc. of IJCAI'20*, 2020, pp. 1855–1861.

[41] J.-G. Mailly, Possible Controllability of Control Argumentation Frameworks, in: *Proc. of COMMA'20*, Vol. 326, 2020, pp. 283–294.

[42] P. Balbiani, A. Herzig and N. Troquard, Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL, in: *28th Annual ACM/IEEE Symposium on Logic in Computer Science, LICS 2013, New Orleans, LA, USA, June 25-28, 2013*, IEEE Computer Society, 2013, pp. 143–152.

[43] J.-G. Mailly, Yes, no, maybe, I don't know: Complexity and application of abstract argumentation with incomplete knowledge, *Argument Comput.* **13**(3) (2022), 291–324.

[44] J.-G. Mailly, A Logical Encoding for k-m-Realization of Extensions in Abstract Argumentation, in: *Logic and Argumentation - 5th International Conference, CLAR 2023, Hangzhou, China, September 10-12, 2023, Proceedings*, A. Herzig, J. Luo and P. Pardo, eds, Lecture Notes in Computer Science, Vol. 14156, Springer, 2023, pp. 84–100. doi:10.1007/978-3-031-40875-5_6.

[45] G. Brewka, H. Strass, S. Ellmauthaler, J.P. Wallner and S. Woltran, Abstract Dialectical Frameworks Revisited, in: *Proc. of IJCAI'13*, F. Rossi, ed., 2013, pp. 803–809.

[46] J.P. Wallner, Structural constraints for dynamic operators in abstract argumentation, *Argument Comput.* **11**(1–2) (2020), 151–190.

[47] H. Prakken, Formalising an Aspect of Argument Strength: Degrees of Attackability, in: *Computational Models of Argument - Proceedings of COMMA 2022, Cardiff, Wales, UK, 14-16 September 2022*, F. Toni, S. Polberg, R. Booth, M. Caminada and H. Kido, eds, Frontiers in Artificial Intelligence and Applications, Vol. 353, IOS Press, 2022, pp. 296–307.

[48] F. Toni, A tutorial on assumption-based argumentation, *Argument Comput.* **5**(1) (2014), 89–117. doi:10.1080/19462166.2013.869878.

[49] A. Darwiche and P. Marquis, A Knowledge Compilation Map, *J. Artif. Intell. Res.* **17** (2002), 229–264.