A Reasoning Model Based on the Production of Acceptable Arguments
Annals of Mathematics and Artificial Intelligence
Elements of Argumentation
Reasoning about preferences in argumentation frameworks
Artificial Intelligence
Monotonic Answer Set Programming*
Journal of Logic and Computation
Bridging the Gap between Abstract Argumentation Systems and Logic
SUM '09 Proceedings of the 3rd International Conference on Scalable Uncertainty Management
Coalitions of arguments: A tool for handling bipolar argumentation frameworks
International Journal of Intelligent Systems
Repairing preference-based argumentation frameworks
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Generalizing stable semantics by preferences
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Support in Abstract Argumentation
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Instantiating abstract argumentation with classical logic arguments: Postulates and properties
Artificial Intelligence
Argumentation frameworks with necessities
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
On the acceptability of arguments in bipolar argumentation frameworks
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
A new approach for preference-based argumentation frameworks
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
In [4] [5], the classical acceptability semantics are generalized by preferences. The extensions under a given semantics correspond to maximal elements of a relation encoding this semantics and defined on subsets of arguments. Furthermore, a set of postulates is proposed to provide a full characterization of any relation encoding the generalized stable semantics. In this paper, we adapt this approach to preference-based argumentation frameworks with necessities. We propose a full characterization of stable and naive semantics in this new context by new sets of adapted postulates and we present a practical method to compute them by using a classical Dung argumentation framework.