Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets

Sergei ObiedkovSergei Obiedkov, Barış SertkayaBarış Sertkaya

Download

Sergei Obiedkov, Barış Sertkaya
Computing Extensions of Abstract Argumentation Frameworks by Enumerating Closed Sets
In Marie-Laure Mugnier, Franz Baader, eds., Proceedings of the 23rd International Conference on Principles of Knowledge Representation and Reasoning, KR 2026, Lisbon, Portugal, to appear

Details
Bibtex

KurzfassungAbstract
We 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, our approach solves them directly by making use of the fact that the mentioned extensions are contained in certain closure systems. Our algorithms enumerate these closed sets and filter the searched extensions. Experimental results show that our approach outperforms the existing approaches for a large number of the test cases.
Projekt:Project: CPEC, SECAI, ScaDS.AI
Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems

@inproceedings{OS2026,
  author    = {Sergei Obiedkov and Bar{\i}{\c{s}} Sertkaya},
  title     = {Computing Extensions of Abstract Argumentation Frameworks by
               Enumerating Closed Sets},
  editor    = {Marie-Laure Mugnier and Franz Baader},
  booktitle = {Proceedings of the 23rd International Conference on Principles of
               Knowledge Representation and Reasoning, {KR} 2026, Lisbon,
               Portugal},
  year      = {2026}
}