An abstract, argumentation-theoretic approach to default reasoning
Artificial Intelligence
Inferring from Inconsistency in Preference-Based Argumentation Frameworks
Journal of Automated Reasoning
On principle-based evaluation of extension-based argumentation semantics
Artificial Intelligence
Reasoning about preferences in argumentation frameworks
Artificial Intelligence
On the issue of reinstatement in argumentation
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
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
Support in Abstract Argumentation
Proceedings of the 2010 conference on Computational Models of Argument: Proceedings of COMMA 2010
Arguing about the trustworthiness of the information sources
ECSQARU'11 Proceedings of the 11th European conference on Symbolic and quantitative approaches to reasoning with uncertainty
Resource boundedness and argumentation
TAFA'11 Proceedings of the First international conference on Theory and Applications of Formal Argumentation
A logic of argumentation for specification and verification of abstract argumentation frameworks
Annals of Mathematics and Artificial Intelligence
Modelling defeasible and prioritized support in bipolar argumentation
Annals of Mathematics and Artificial Intelligence
A socio-cognitive model of trust using argumentation theory
International Journal of Approximate Reasoning
Hi-index | 0.00 |
In this paper we introduce a theory of meta-argumentation, by using Dung’s theory of abstract argumentation to reason about itself. Meta-arguments are generated from atomic arguments, and extensions of acceptable meta-arguments are based on Dung’s argumentation semantics. To illustrate our theory, we show how to represent Toulmin schemes in this theory by introducing meta-arguments using the Caminada labeling, and meta-arguments for support.