Tags:abstract argumentation, abstract argumentation framework, Abstract argumentation frameworks, argumentation framework, artificial intelligence, associated reasoning task, associated valuation, attack variable, constrained incomplete af, constrained incomplete argumentation framework, control argument, control argumentation framework, Control argumentation framewroks, control configuration, directed graph, dynamic logic, Dynamic logic of propositional assignments, formal argumentation, incomplete argumentation, incomplete argumentation framework, propositional assignment, qualitative uncertainty, rich incomplete af and rich incomplete argumentation framework
Abstract:
We extend the existing encoding of abstract argumentation frameworks in DL-PA (Dynamic Logic of Propositional Assignments) in order to capture different formalisms for arguing with qualitative forms of uncertainty. More in particular, we encode the main reasoning tasks of (rich) incomplete argumentation frameworks and control argumentation frameworks. After that, and inspired by our encoding, we define and study a new class of structures that are shown to be maximally expressive (called constrained incomplete argumentation frameworks).
Abstract Argumentation with Qualitative Uncertainty: an Analysis in Dynamic Logic