Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets

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

Toggle side column

Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets

Sarah Alice GagglSarah Alice Gaggl,  Stefan WoltranStefan Woltran
Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets


Slides: Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets

Sarah Alice Gaggl, Stefan Woltran
Strong Equivalence for Argumentation Semantics Based on Conflict-Free Sets
In Weiru Liu, eds., Proceedings of the 11th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2011), volume 6717 of Lecture Notes in Computer Science, 38-49, June 2011. Springer
  • KurzfassungAbstract
    Argumentation can be understood as a dynamic reasoning process, i.e. it is in particular useful to know the effects additional information causes with respect to a certain semantics. Accordingly, one can identify the information which does not contribute to the results no matter which changes are performed. In other words, we are interested in so-called kernels of frameworks, where two frameworks with the same kernel are then “immune” to all kind of newly added information in the sense that they always produce an equal outcome. The concept of strong equivalence for argumentation frameworks captures this intuition and has been analyzed for several semantics which are all based on the concept of admissibility. Other important semantics have been neglected so far. To close this gap, we give strong equivalence results with respect to naive, stage and cf2 extensions, and we compare the new results with the already existing ones. Furthermore, we analyze strong equivalence for symmetric frameworks and discuss local equivalence, a certain relaxation of strong equivalence.
  • Forschungsgruppe:Research Group: Computational Logic
The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-22152-1.
@inproceedings{GW2011,
  author    = {Sarah Alice Gaggl and Stefan Woltran},
  title     = {Strong Equivalence for Argumentation Semantics Based on
               Conflict-Free Sets},
  editor    = {Weiru Liu},
  booktitle = {Proceedings of the 11th European Conference on Symbolic and
               Quantitative Approaches to Reasoning with Uncertainty (ECSQARU
               2011)},
  series    = {Lecture Notes in Computer Science},
  volume    = {6717},
  publisher = {Springer},
  year      = {2011},
  month     = {June},
  pages     = {38-49},
  doi       = {10.1007/978-3-642-22152-1}
}