atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

The Complexity Landscape of Claim-Augmented Argumentation Frameworks

AAAI 2021 · Learning theory and algorithms › Combinatorial and search optimization · approach: Logic and answer set programming theory · 8 citations (OpenAlex)

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 changedWhereMeasuredEffect
Move maximality selection from arguments to claimsnaive semantics on general CAFs · General CAFsskeptical acceptance complexity: inherited semantics: coNP-c; cl-naive: ΠP₂-cHurt
Move preferred-extension selection from arguments to claimspreferred semantics on general CAFs · General CAFsverification complexity: inherited semantics: ΣP₂-c; cl-prf: DP-cHelped
Evaluate claim-level maximality on well-formed CAFsverification for the considered semantics · Well-formed CAFsverification complexity: coNP-cHelped
Compare inherited and claim-level variants for semi-stable semanticssemi-stable semantics on general CAFs · General CAFsconcurrence complexity: ΠP₃-cHurt
Compare inherited and claim-level variants for stage semanticsstage semantics on general CAFs · General CAFsconcurrence complexity: ΠP₃-cHurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy