Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets
From International Center for Computational Logic
Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets
Talk by Sergei Obiedkov
- Location: APB-2026
- Start: 16. July 2026 at 11:00 am
- End: 16. July 2026 at 12:00 pm
- Research group: Knowledge-Based Systems
- Event series: Research Seminar Logic and AI
- iCal
The talk will present a new approach for computing complete, stable, and preferred extensions of abstract argumentation frameworks. Unlike existing approaches that reduce these problems to the propositional satisfiability problem and solve them with the help of SAT-solvers, the presented approach solves them directly by making use of the fact that the mentioned extensions are contained in certain closure systems. Algorithms enumerate these closed sets and filter the searched extensions. Experimental results show that the approach outperforms the existing approaches for a large number of the test cases.
