Affiliation:
1. Department of Mathematics and Computer Science, University of Perugia , Via Luigi Vanvitelli, 1, 06123 Perugia PG, Italy
Abstract
Abstract
Computational Argumentation provides tools for both modelling and reasoning with controversial information. Abstract Argumentation Frameworks represent the building blocks in this field and allow one to model the relationships between arguments with the ultimate goal of establishing their acceptability. Arguments can be evaluated through sets of criteria, called semantics, which distinguish among various justification states. For example, an argument may be accepted, rejected, ignored or even marked as undecided. This paper considers Weighted Argumentation Frameworks and proposes a novel labelling semantics that differentiates four states and generalizes existing approaches.
Publisher
Oxford University Press (OUP)
Subject
Logic,Hardware and Architecture,Arts and Humanities (miscellaneous),Software,Theoretical Computer Science
Reference36 articles.
1. On the logic of theory change: partial meet contraction and revision functions;Alchourrón;The Journal of Symbolic Logic,1985
2. Ranking-based semantics for argumentation frameworks;Amgoud,2013
3. On the acceptability of arguments in preference-based argumentation;Amgoud,1998
4. On the acceptance of loops in argumentation frameworks;Arieli;The Journal of Logic and Computation,2016
5. An introduction to argumentation semantics;Baroni;The Knowledge Engineering Review,2011