A Labeling Based Backtracking Solver for Abstract ArgumentationLukas Kinder, Matthias Thimm, Bart VerheijTHEIA is a labeling-based system computing the complete extensions of an abstract argumentation framework. Like other backtracking solvers, THEIA does this by repeatedly choosing an argument and labelling it until either a contradiction with respect to the labels is reached or a complete extension is found. THEIA reduces the number of backtracking steps needed by using propagation techniques that use a larger set of labels. These labels keep track of arguments that cannot be labeled IN, OUT or UNDEC during a state in the search. THEIA is also using an extensive look-ahead strategy to prune branches. It is shown that THEIA outperforms related labeling-based backtracking solvers by the use of more sophisticated propagation and pruning rules and forward-looking strategy.This paper is based on Lukas Kinder's BSc thesis and was presented by him at SAFA 2022. Manuscript (in PDF-format) Full proceedings Reference: Kinder, L., Thimm, M., & Verheij, B. (2022). A Labeling Based Backtracking Solver for Abstract Argumentation. SAFA 2022. The Fourth International Workshop on Systems and Algorithms for Formal Argumentation 2022. Proceedings of the Fourth International Workshop on Systems and Algorithms for Formal Argumentation co-located with the 9th International Conference on Computational Models of Argument (COMMA 2022). Cardiff, Wales, United Kingdom, September 13, 2022. (eds. Gaggl, S.A., Mailly, J., Thimm, M., & Wallner, J.P.). CEUR Workshop Proceedings. http://ceur-ws.org/Vol-3236/paper9.pdf Bart Verheij's home page - research - publications |