AgonProject › Glossary › AF

Undisputed Sets

A set E⊆AE \subseteq A is undisputed iff EE is conflict-free and the reduct FEF^E has no non-empty admissible set.

Remarks

That is, ud=cfad\mathsf{ud} = \mathsf{cf}^{\mathsf{ad}}, a vacuous reduct semantics.

Reference

Thimm, M. (2023). On Undisputed Sets in Abstract Argumentation. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence (AAAI 2023), pp. 6550–6557. AAAI Press.

Referenced by

  • Strongly Undisputed Sets
  • Extension-based Semantics