AFCA: Searching for Complete Extensions via Enumeration of a Closure System

Sergei ObiedkovSergei Obiedkov, Barış SertkayaBarış Sertkaya

Download

Sergei Obiedkov, Barış Sertkaya
AFCA: Searching for Complete Extensions via Enumeration of a Closure System
In Iosif Apostolakis, Andrei Popesci, Johannes P. Wallner, eds., Solver and Benchmark Descriptions of ICCMA 2025: Sixth International Competition on Computational Models of Argumentation, 11–12, 2026

Details
Bibtex

KurzfassungAbstract
AFCA is a solver for abstract argumentation that operates by enumerating closed sets. Unlike most other solvers, it does not rely on SAT or CSP solvers. Instead, AFCA adapts algorithms from formal concept analysis used for enumerating closed sets of a closure system. While the system supports several semantics, this paper focuses on the algorithm used for credulous acceptance under complete semantics. The approach is based on enumerating subsets of arguments that are semicomplete—that is, conflict-free sets containing all the arguments they defend. We show that semicomplete sets form a closure system, and we leverage this property to design a targeted enumeration algorithm. In contrast to generic enumeration, our method reduces the search space by dynamically selecting relevant defenders and pruning infeasible branches.
Weitere Informationen unter:Further Information: Link
Projekt:Project: ScaDS.AI
Forschungsgruppe:Research Group: Wissensbasierte SystemeKnowledge-Based Systems

@article{obiedkov2025afca,
  title={AFCA: Searching for Complete Extensions via Enumeration of a Closure System},
  author={Obiedkov, Sergei and Sertkaya, Bar{\i}s},
  journal={ICCMA 2025},
  pages={11}
}@article{obiedkov2025afca,
  title={AFCA: Searching for Complete Extensions via Enumeration of a Closure System},
  author={Obiedkov, Sergei and Sertkaya, Bar{\i}s},
  journal={ICCMA 2025},
  pages={11--12}
}