Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets

Vortrag von Sergei Obiedkov

Veranstaltungsort: APB-2026
Beginn: 16. Juli 2026 um 11:00
Ende: 16. Juli 2026 um 12:00
Forschungsgruppe: Wissensbasierte Systeme
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.

The talk will be presented at KR 2026 in Lisbon.

BBB room for online attendees: https://bbb.tu-dresden.de/rooms/sqo-ezi-97u-sry/join