Research map / Learning theory and algorithms / Combinatorial and search optimization
On Undisputed Sets in Abstract Argumentation
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use conflict-freeness and require the reduct to contain no non-empty admissible set | Undisputed sets · Abstract argumentation frameworks | coverage of preferred extensions | Helped |
| Use strongly undisputed sets, requiring the reduct to contain no non-empty undisputed set | Undisputed-set semantics · F0 and F1 | acceptance of {b} | Helped |
| Require the reduct to be undisputed-vacuous | Undisputed-set semantics · F4 | exclusion of {c} | Helped |
| Use strongly undisputed rather than weakly admissible semantics | Reasoning with argumentation frameworks · General abstract argumentation frameworks | computational complexity | Helped |
Closest papers by meaning
- Recursion in Abstract Argumentation is Hard — On the Complexity of Semantics Based on Weak Admissibility (AAAI 2021 · similarity 0.92)
- Redefining ABA+ Semantics via Abstract Set-to-Set Attacks (AAAI 2024 · similarity 0.90)
- Complexity of Verification in Incomplete Argumentation Frameworks (AAAI 2018 · similarity 0.89)
- Non-flat ABA Is an Instance of Bipolar Argumentation (AAAI 2024 · similarity 0.89)
- Dung’s Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases (AAAI 2025 · similarity 0.88)
- Defeasible Normative Reasoning: A Proof-Theoretic Integration of Logical Argumentation (AAAI 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.