Computational Aspects of cf2 and stage2 Argumentation Semantics

Aus International Center for Computational Logic
Wechseln zu:Navigation, Suche

Toggle side column

Computational Aspects of cf2 and stage2 Argumentation Semantics

Wolfgang DvořákWolfgang Dvořák,  Sarah Alice GagglSarah Alice Gaggl
Computational Aspects of cf2 and stage2 Argumentation Semantics


Wolfgang Dvořák, Sarah Alice Gaggl
Computational Aspects of cf2 and stage2 Argumentation Semantics
In Bart Verheij, Stefan Szeider, Stefan Woltran, eds., Proceedings of the 4th International Conference on Computational Models of Argument (COMMA 2012), volume 245 of Frontiers in Artificial Intelligence and Applications, 273-284, 2012. IOS Press
  • KurzfassungAbstract
    We consider two instantiations of the SCC-recursive schema for argumentation semantics, cf2, using maximal conflict-free sets as base semantics, and stage2, using stage extensions as base semantics. Both of them have been shown to be in general of high complexity. We provide a detailed analysis of possible tractable fragments for these semantics. Moreover we present a labeling based algorithm for computing cf2 extension, which is complexity-sensitive w.r.t. one of the tractable fragments.
  • Forschungsgruppe:Research Group: Computational Logic
@inproceedings{DG2012,
  author    = {Wolfgang Dvo{\v{r}}{\'{a}}k and Sarah Alice Gaggl},
  title     = {Computational Aspects of cf2 and stage2 Argumentation Semantics},
  editor    = {Bart Verheij and Stefan Szeider and Stefan Woltran},
  booktitle = {Proceedings of the 4th International Conference on Computational
               Models of Argument (COMMA 2012)},
  series    = {Frontiers in Artificial Intelligence and Applications},
  volume    = {245},
  publisher = {IOS Press},
  year      = {2012},
  pages     = {273-284},
  doi       = {10.3233/978-1-61499-111-3-273}
}