A Labeling Approach to the Computation of Credulous Acceptance in Argumentation
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 623-627.
Abstract
In recent years, the combinatorics of argumentation with arguments that can attack each other has been studied extensively. Especially, attack graphs (put in the focus of attention by Dung's seminal work 1995) have proven to be a productive tool of analysis. In this paper a new style of algorithm is presented that computes the minimal admissible sets containing or attacking the argument. It is a breadth-first algorithm using labelings. The algorithm is applied to the computation of the preferred and stable extensions of a given attack graph.
@inproceedings{ijcai2007p99,
title = {A Labeling Approach to the Computation of Credulous Acceptance in Argumentation},
author = {Verheij, Bart},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {623--627},
year = {2007},
url = {https://ijcai.org/proceedings/2007/99},
}
TY - CPAPER TI - A Labeling Approach to the Computation of Credulous Acceptance in Argumentation AU - Verheij, Bart T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 623 EP - 627 UR - https://ijcai.org/proceedings/2007/99 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
