On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks

@inproceedings{Krll2017OnTC,
  title={On the Complexity of Enumerating the Extensions of Abstract Argumentation Frameworks},
  author={Markus Kr{\"o}ll and Reinhard Pichler and Stefan Woltran},
  booktitle={IJCAI},
  year={2017}
}
Several computational problems of abstract argumentation frameworks (AFs) such as skeptical and credulous reasoning, existence of a non-empty extension, verification, etc. have been thoroughly analyzed for various semantics. In contrast, the enumeration problem of AFs (i.e., the problem of computing all extensions according to some semantics) has been left unexplored so far. The goal of this paper is to fill this gap. We thus investigate the enumeration complexity of AFs for a large collection… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 53 references

Ecsqaru 2005

  • Sylvie Coste-Marquis, Caroline Devred, Pierre Marquis. Symmetric argumentation frameworks. In Proc
  • volume 3571 of LNCS, pages 317–328. Springer,
  • 2005
Highly Influential
4 Excerpts

37(1):102–104

  • Matthias Thimm, Serena Villata, Federico Cerutti, Nir Oren, Hannes Strass, Mauro Vallati. Summary report of the first international Magazine
  • April
  • 2016
1 Excerpt

Icdt 2016

  • Markus Kröll, Reinhard Pichler, Sebastian Skritek. On the complexity of enumerating the answ Proc
  • volume 48 of LIPIcs, pages 22:1–22:18,
  • 2016
3 Excerpts

Kr 2014

  • Federico Cerutti, Massimiliano Giacomin, Mauro Vallati, Marina Zanella. An SCC recursive meta-algorithm for compu Proc
  • pages 42–51,
  • 2014
1 Excerpt

Similar Papers

Loading similar papers…