Research map / Learning theory and algorithms / Combinatorial and search optimization
Complexity of Verification in Incomplete Argumentation Frameworks
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.
Closest papers by meaning
- Complexity of Credulous and Skeptical Acceptance in Epistemic Argumentation Framework (AAAI 2024 · similarity 0.90)
- Dung’s Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases (AAAI 2025 · similarity 0.89)
- Defeasible Normative Reasoning: A Proof-Theoretic Integration of Logical Argumentation (AAAI 2024 · similarity 0.87)
- Argumentative Large Language Models for Explainable and Contestable Claim Verification (AAAI 2025 · similarity 0.87)
- Non-flat ABA Is an Instance of Bipolar Argumentation (AAAI 2024 · similarity 0.87)
- Redefining ABA+ Semantics via Abstract Set-to-Set Attacks (AAAI 2024 · similarity 0.86)
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.
