Attack Semantics for Abstract Argumentation
Abstract
In this paper we conceptualize abstract argumentation in terms of successful and unsuccessful attacks, such that arguments are accepted when there are no successful attacks on them. We characterize the relation between attack semantics and Dung's approach, and we define an SCC recursive algorithm for attack semantics using attack labelings.
Cite
Text
Villata et al. "Attack Semantics for Abstract Argumentation." International Joint Conference on Artificial Intelligence, 2011. doi:10.5591/978-1-57735-516-8/IJCAI11-076Markdown
[Villata et al. "Attack Semantics for Abstract Argumentation." International Joint Conference on Artificial Intelligence, 2011.](https://mlanthology.org/ijcai/2011/villata2011ijcai-attack/) doi:10.5591/978-1-57735-516-8/IJCAI11-076BibTeX
@inproceedings{villata2011ijcai-attack,
title = {{Attack Semantics for Abstract Argumentation}},
author = {Villata, Serena and Boella, Guido and van der Torre, Leendert W. N.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2011},
pages = {406-413},
doi = {10.5591/978-1-57735-516-8/IJCAI11-076},
url = {https://mlanthology.org/ijcai/2011/villata2011ijcai-attack/}
}