Forgetting in abstract argumentation: limits and possibilities
From MaRDI portal
Cites work
- A Generalization of Dung’s Abstract Framework for Argumentation: Arguing with Sets of Attacking Arguments
- A knowledge level account of forgetting
- A new approach for preference-based argumentation frameworks
- A survey of multiple contractions
- A syntactic operator for forgetting that satisfies strong persistence
- Analyzing the computational complexity of abstract dialectical frameworks via approximation fixpoint theory
- Approximating operators and semantics for abstract dialectical frameworks
- Characteristics of multiple viewpoints in abstract argumentation
- Characterizing strong equivalence for argumentation frameworks
- Computing ideal sceptical argumentation
- Encompassing Attacks to Attacks in Abstract Argumentation Frameworks
- Explanations, belief revision and defeasible reasoning.
- scientific article; zbMATH DE number 1946872 (Why is no real title available?)
- scientific article; zbMATH DE number 6934384 (Why is no real title available?)
- Infinitary belief revision
- Infinite argumentation frameworks. On the existence and uniqueness of extensions
- Logic-based approaches to formal argumentation
- Model-based recasting in answer-set programming
- Nested expressions in logic programs
- Normal and strong expansion equivalence for argumentation frameworks
- On naive labellings -- realizability, construction and patterns of redundancy
- On principle-based evaluation of extension-based argumentation semantics
- On rejected arguments and implicit conflicts: the hidden power of argumentation semantics
- On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games
- On the expressive power of assumption-based argumentation
- On the logic of theory change: Partial meet contraction and revision functions
- Preserving strong equivalence while forgetting
- Revision, acceptability and context. Theoretical and algorithmic aspects.
- Strongly equivalent logic programs
- When you must forget: Beyond strong persistence when forgetting in answer set programming
- You can't always forget what you want: on the limits of forgetting in answer set programming
This page was built for publication: Forgetting in abstract argumentation: limits and possibilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7014307)
