Understanding the abstract dialectical framework
From MaRDI portal
Publication:2835889
DOI10.1007/978-3-319-48758-8_28zbMATH Open1483.68384arXiv1607.00819OpenAlexW2544695636MaRDI QIDQ2835889FDOQ2835889
Authors: Sylwia Polberg 
Publication date: 30 November 2016
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Abstract: Among the most general structures extending the framework by Dung are the abstract dialectical frameworks (ADFs). They come equipped with various types of semantics, with the most prominent - the labeling-based one - analyzed in the context of computational complexity, signatures, instantiations and software support. This makes the abstract dialectical frameworks valuable tools for argumentation. However, there are fewer results available concerning the relation between the ADFs and other argumentation frameworks. In this paper we would like to address this issue by introducing a number of translations from various formalisms into ADFs. The results of our study show the similarities and differences between them, thus promoting the use and understanding of ADFs. Moreover, our analysis also proves their capability to model many of the existing frameworks, including those that go beyond the attack relation. Finally, translations allow other structures to benefit from the research on ADFs in general and from the existing software in particular.
Full work available at URL: https://arxiv.org/abs/1607.00819
Recommendations
Cites Work
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and \(n\)-person games
- A reasoning model based on the production of acceptable arguments
- Persuasion in Practical Argument Using Value-based Argumentation Frameworks
- A new approach for preference-based argumentation frameworks
- Reasoning about preferences in argumentation frameworks
- Meta-argumentation modelling. I: Methodology and techniques
- Instantiating knowledge bases in abstract dialectical frameworks
- Metalevel argumentation
- Approximating operators and semantics for abstract dialectical frameworks
- A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
- Revisiting Abstract Argumentation Frameworks
- Bipolarity in argumentation graphs: towards a better understanding
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- Title not available (Why is that?)
Cited In (18)
- Instantiating knowledge bases in abstract dialectical frameworks
- Empirical evaluation of abstract argumentation: supporting the need for bipolar and probabilistic approaches
- Nonmonotonic tools for argumentation
- On the equivalence between abstract dialectical frameworks and logic programs
- Comparing the expressiveness of argumentation semantics
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving
- Realizability of three-valued semantics for abstract dialectical frameworks
- Expressiveness of SETAFs and support-free ADFs under 3-valued semantics
- Graph-classes of argumentation frameworks with collective attacks
- Approximating operators and semantics for abstract dialectical frameworks
- Admissibility in the abstract dialectical framework
- Characterizing acceptability semantics of argumentation frameworks with recursive attack and support relations
- An epistemic interpretation of abstract dialectical argumentation
- Delegated updates in epistemic graphs for opponent modelling
- Epistemic graphs for representing and reasoning with positive and negative influences of arguments
- Title not available (Why is that?)
- Judgment aggregation in abstract dialectical frameworks
- On the expressive power of assumption-based argumentation
Uses Software
This page was built for publication: Understanding the abstract dialectical framework
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2835889)
